On the asymptotic behavior of the average geodesic distance L and the compactness CB of simple connected undirected graphs whose order approaches infinity
The average geodesic distance L Newman (2003) and the compactness CB Botafogo (1992) are important graph indices in applications of complex network theory to real-world problems. Here, for simple connected undirected graphs G of order n, we study the behavior of L(G) and CB(G), subject to the condit...
Main Authors: | Tatiana Lokot, Olga Abramov, Alexander Mehler |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2021-01-01
|
Series: | PLoS ONE |
Online Access: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8592497/?tool=EBI |
Similar Items
-
On the asymptotic behavior of the average geodesic distance L and the compactness CB of simple connected undirected graphs whose order approaches infinity.
by: Tatiana Lokot, et al.
Published: (2021-01-01) -
On the limit value of compactness of some graph classes.
by: Tatiana Lokot, et al.
Published: (2018-01-01) -
On topological spaces generated by simple undirected graphs
by: Hatice Kübra Sarı, et al.
Published: (2020-07-01) -
Simple graphs whose 2-distance graphs are path or cycle
by: Ali Azimi, et al.
Published: (2014-10-01) -
A simple interpretation of undirected edges in essential graphs is wrong.
by: Erich Kummerfeld
Published: (2021-01-01)