References
[1] H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, “Towards capturing representative AS-level Internet topologies,” Technical Report UM-CSE-TR-454-02, University of Michigan Computer Science, 2002.
[4] D. Vukadinovic, P. Huang, and T. Erlebach, “A spectral analysis of the Internet topology,” ETH TIK-NR. 118, 2001.
[5] F. R. K. Chung, Spectral Graph Theory. Providence, Rhode Island: Conference Board of the Mathematical Science, 1997.
[6] R. Grone, R. Merris, and V. S. Sunder, “The Laplacian spectrum of a graph,” SIMA Journal on Matrix Analysis and Applications, vol. 11, no. 2, pp. 218-238, April 1990.
[7] D. Cvetkovic, M. Doob, and H. Sachs, Spectra of Graphs 3rd edition. New York: Academic Press, 1995.
[8] B. Huffaker, D. Plummer, and D. Moore, “Topology discovery by active probing”, 2002: http://www.caida.org/outreach/papers/2002/SkitterOverview.
[9] A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, "Graph structure in the web," in Proceedings of WWW9 Conference, 2000: http://www9.org/w9cdrom/160/160.html.
[10] http://www.cisco.com/univercd/cc/td/doc/cisintwk/ito_doc/bgp.htm.