By Topic

Deterministic small-world graphs and the eigenvalue power law of Internet

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cornelias, F. ; Departament de Matematica Aplicada, Univ. Politecnica de Catalunya, Barcelona, Spain ; Gago, S.

Many relevant real-life networks like the WWW, Internet, transportation and communication networks, or even biological and social networks can be modelled by small-world scale-free graphs. These graphs have strong local clustering (vertices have many mutual neighbors), a small diameter and a distribution of degrees according to a power law. On the other hand, the knowledge of the spectrum of a graph is important for the relation which the eigenvalues and their multiplicities have with relevant graph invariants and topological and communication properties such as diameter, bisection width, distances, connectivity, expansion, partitions, edge-loading distribution etc. In this paper we introduce a new family of deterministic small-world graphs, we determine analytically their spectra and we show how these graphs can model the eigenvalue power-law of the Internet network.

Published in:

Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on

Date of Conference:

10-12 May 2004