Minimal and maximal characteristic path lengths in connected sociomatrices

Social Networks

Volumn 25, Issue 4, 2003, Pages 333-347

  Lovejoy, William S ^a   Loch, Christoph H ^b,c  

^a UNIVERSITY OF MICHIGAN   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

^c INSEAD   (France)

Author keywords

Asymptotic limits; Benchmark; Network

Indexed keywords

EID: 0242720138     PISSN: 03788733     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.socnet.2003.10.001     Document Type: Article

References (8)

1. Bollobas B. Random Graphs. Cambridge University Press. Cambridge, 2001.
2. Chung F. Diameters and eigenvalues Journal of the American Mathematical Society 22 1989 187-196
3. Chung F. Faber V. Manteuffel T. An upper bound on the diameter of a graph from eigenvalues associated with its Laplacian Siam Journal of Discrete Mathematics 73 1994 443-457
4. Doyle J. Graver J. Mean distance in a graph Discrete Mathematics 17 1977 147-154
5. Entringer R. Jackson D. Snyder D. Distance in graphs Czechoslovak Mathematical Journal 26101 1976 283-296
6. Harary F. Graph Theory. Addison-Wesley, Reading, MA, 1972.
7. Plesnik J. On the sum of all distances in a graph or digraph Journal of Graph Theory 8 1984 l-21
8. Watts D. Small Worlds. Princeton University Press, Princeton, NJ, 1999.