×

On the universality of small-world graphs. (English) Zbl 1171.05435

Nešetřil, Jaroslav (ed.) et al., Comb01—Euroconference on combinatorics, graph theory and applications. Extended abstracts from the conference, Barcelona, Spain, September 12–15, 2001. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 10, 84-87 (2001).
For the entire collection see [Zbl 1109.05012].

MSC:

05C99 Graph theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Albert, R.; Jeong, H.; Barabási, A.-L., Diameter of the world wide web, Nature, vol. 401, 130-131 (1999)
[2] de Castro, R.; Grossman, J. W., Famous trails to Paul Erdös, The Mathematical Intelligencer, 21, 3, 51-63 (1999) · Zbl 1052.01519
[3] Comellas, F.; Ozón, J.; Peters, J. G., Deterministic small-world communication networks, Inform. Process. Lett., 6, 83-90 (2000) · Zbl 1338.68012
[4] Hayes, T. W.; Hedetniemi, S. T.; Slater, P. J., Fundamentals of Domination in Graphs (1998), Marcel Dekker Inc: Marcel Dekker Inc New York · Zbl 0890.05002
[5] Henning, M. A.; Oellermann, O. R.; Swart, H. C., Bounds on distance domination parameters, J. Combin. Inform. System Sci., 16, 11-18 (1991) · Zbl 0766.05040
[6] Ozón, J., A Contribution to Graph Coloring and Small-World Networks, Ph.D. Thesis, Universitat Politecnica de Catalunya, submitted (2001)
[7] Watts, D. J.; Strogatz, H., Collective dynamics of “small-world” networks, Nature, 393, 440-442 (1998) · Zbl 1368.05139
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.