Influence of the network structure on robustness

ICON 2007 - Proceedings of the 2007 15th IEEE International Conference on Networks

Volumn , Issue , 2007, Pages 278-283

  Jamakovic, A ^a   Uhlig, S ^a  

^a Department of Microelectronics   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; MATRIX ALGEBRA; RANDOM PROCESSES; RHENIUM;

ALGEBRAIC CONNECTIVITY; HETEROGENEOUS STRUCTURES; HOMOGENEOUS STRUCTURES; INDEPENDENT COMPONENTS; INTERNATIONAL CONFERENCES; LINK FAILURES; NETWORK MODELLING; NETWORK STRUCTURES; NODE FAILURES; NON-TRIVIAL; RANDOM GRAPHS; SCALE-FREE; SMALL WORLDS;

GRAPH THEORY;

EID: 48149114865     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICON.2007.4444099     Document Type: Conference Paper

References (19)

1. ALBERT, R., BARABASI, A.-L., Statistical mechanics of complex networks. Reviews of Modern Physics 74, 47 (2002).
2. BARABASI, A.-L. AND ALBERT, R., Emergence of scaling in random networks, Science 286, pp. 509-512 (1999).
3. BOLLOBÁS, B. AND THOMASON, A.C. Random graphs of small order. In random graphs., Annals of Discr. Math., pp.47-97 (1985).
4. BOLLOBÁS, B., Modern graph theory, Springer-Verlag New York, Inc (1998).
5. BOLLOBÁS, B., Random graphs, Cumbridge University Press (2001).
6. CAHN, R., Wide Area Network Design: Concepts & Tools for Optimization, Morgan Kaufmann (1997).
7. ERDOS, P. AND RÉNYI, A., On random graphs, Publicationes Mathematicae 6, pp. 290-297 (1959).
8. FIEDLER, M., Algebraic connectivity of graphs, Czechoslovak Mathematical Journal 23. pp. 298-305 (1973).
9. GRONE, R., MERRIS, R., SUNDER, V.S., The Laplacian spectrum of a graph, SIAM Journal on Matrix Analysis 11, pp. 218-238 (1990).
10. GRONE. R., On the geometry and Laplacian of a graph. Linear Algebra and its Applications 150, 167-178 (1991).
11. JANSON, S., KNUTH, D.E., LUCZAK, T. AND PITTEL, B., The birth of the giant component. Random Structures & Algorithms, vol. 4, 233-358 (1993).
12. JAMAKOVIC, A. UHLIG, S. On the relationship between the algebraic connectivity and graph's robustness to node and link failures, Proceedings of the 3rd IEEE EURO-NGI Conference on Next Generation Internet Networks. Norway (2007).
13. MENGER, K., Zur allgemeinen Kurventhoerie. Fundamenta Mathematicae 10:96-115. (1927).
14. MERRIS. R. Laplacian matrices of graphs: a survey. Linear Algebra and its Applications 197 (1). pp. 143-176 (1994).
15. MOHAR. B., ALAVI, Y., CHARTRAND, G., OELLERMANN, O.R. AND SCHWENK, A.J., The Laplacian spectrum of graphs. Graph Theory. Combinatorics and Applications 2, pp. 871-898 (1991).
16. MOHAR. B., HAHN, G., SABIDUSSI, G. Some applications of Laplace eigenvalues of graphs,Graph Symmetry: Algebraic Methods and Applications, NATO ASI Ser. C 497, pp. 225-275 (1997).
17. NEWMAN, M.E.J., The structure and function of complex networks, SIAM Review 45, pp. 167-256 (2002).
18. VAN MIEOHEM, P., Performance Analysis of Computer Systems and Networks, Cambridge University Press (2006).
19. WATTS, D.J. AND STROGATZ, S.H., Collective dynamics of smallworld networks, Nature 393, pp. 440-442 (1999).