Results 31 to 40 of about 2,145,411 (284)
Relaxation dynamics of maximally clustered networks [PDF]
, 2017 We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics---the double-edge swap, corresponding to degree-preserving randomization of the configuration model, and ...
A. R. Rao +7 more
core +3 more sources
Using a Bayesian approach to reconstruct graph statistics after edge sampling
Applied Network Science, 2023 Often, due to prohibitively large size or to limits to data collecting APIs, it is not possible to work with a complete network dataset and sampling is required.
Naomi A. Arnold +2 more
doaj +1 more source
Computation of Vertex-Edge Degree Based Topological Descriptors for Hex-Derived Networks
IEEE Access, 2021 A numeric number that represents the entire structure of a graph is defined to be a topological descriptor. Graph theory has been found to be a useful area of research in the direction of topological descriptors.
Ali N. A. Koam +2 more
doaj +1 more source
The average degree of edge chromatic critical graphs with maximum degree seven
Journal of Graph Theory, 2023 AbstractIn this paper, by developing several new adjacency lemmas about a path on four or five vertices, we show that the average degree of 7‐critical graphs is at least 6. It implies Vizing's planar graph conjecture for planar graphs with maximum degree 7 and its extension to graphs embeddable in a surface with nonnegative Euler characteristic due to ...
Yan Cao +3 more
openaire +2 more sources
Computation of Vertex-Edge Degree Based Topological Descriptors for Metal Trihalides Network
IEEE Access, 2021 In recent past 2D metal trihalides have evolved as useful gapless semiconductor due to their physical properties like low dimensional magnetism and thermo electric performance.
Fouad A. Abolaban +2 more
doaj +1 more source
Some models for inverse minimum spanning tree problem with uncertain edge weights [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2022 The inverse minimum spanning tree (IMST) problem is an inverse optimization problem in which one makes the least modification to the edge weights of a predetermined spanning tree, to make it the minimum spanning tree with respect to new edge weights ...
Sagarika Biswal, Ganesh Ghorai
doaj +1 more source
Bose-Einstein condensation in random directed networks [PDF]
, 2003 We consider the phenomenon of Bose-Einstein condensation in a random growing directed net- work. The network grows by the addition of vertices and edges. At each time step the network gains a vertex with probabilty p and an edge with probability 1 − p.
Rodgers, GJ, Sotolongo-Costa, O
core +2 more sources
The Effect of Random Edge Removal on Network Degree Sequence [PDF]
The Electronic Journal of Combinatorics, 2012 Many networks arise in a random and distributed fashion, and yet result in having a specific type of degree structure: e.g., the WWW, many social networks, biological networks, etc., exhibit power-law, stretched exponential, or similar degree structures.
Dubois, Thomas +2 more
openaire +3 more sources
Evolution Model of Spatial Interaction Network in Online Social Networking Services
Entropy, 2019 The development of online social networking services provides a rich source of data of social networks including geospatial information. More and more research has shown that geographical space is an important factor in the interactions of users in ...
Jian Dong +6 more
doaj +1 more source
Number of edges in degree-magic graphs
Discrete Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bezegová, L'udmila, Ivančo, Jaroslav
openaire +1 more source