Old and new results on algebraic connectivity of graphs

Linear Algebra and Its Applications

Volumn 423, Issue 1, 2007, Pages 53-73

  de Abreu, Nair Maria Maia ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Algebraic connectivity; Bounds for the algebraic connectivity; Extremal graphs; Fiedler vectors; Laplacian integral graphs; Laplacian of graph; Limit points; Vertex and edge connectivities

Indexed keywords

COMBINATORIAL OPTIMIZATION; EIGENVALUES AND EIGENFUNCTIONS; FUNCTION EVALUATION; GRAPH THEORY; LAPLACE EQUATION;

ALGEBRAIC CONNECTIVITY; BOUNDS FOR THE ALGEBRAIC CONNECTIVITY; EXTREMAL GRAPHS; FIEDLER VECTORS; LAPLACIAN INTEGRAL GRAPHS; LAPLACIAN OF GRAPH; LIMIT POINTS; VERTEX AND EDGE CONNECTIVITIES;

LINEAR ALGEBRA;

EID: 33947178314     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2006.08.017     Document Type: Article

References (74)

1. Alon N. Eigenvalues and expanders. Combinatorica 6 2 (1986) 83-96
2. 1 isoperimetric inequalities for graphs and superconcentrators. J. Combin. Theory. Ser. B 38 (1985) 73-88
3. Barik S., and Pati S. On algebraic connectivity and spectral integral variations of graphs. Linear Algebra Appl. 397 (2005) 209-222
4. Belhaiza S., Abreu N.M.M., Hansen P., and Oliveira C.S. VNS for extremal graphs 11. Bounds on algebraic connectivity. In: Avis, Herzt, and Marcotte (Eds). Graph Theory and Combinatorial Optimization vol. 8 (2005), Springer 1-16
5. Berman A., and Zhang X.-D. Lower bounds for the eigenvalues of Laplacian matrices. Linear Algebra Appl. 316 (2000) 13-20
6. N. Biggs, Algebraic Graph Theory Cambridge Mathematical Library, second ed., 1993.
7. A.G. Boshier, Enlarging properties of graphs, Ph.D. Thesis, Royal Holloway and Bedford New College, University of London, 1987.
8. Caparossi G., and Hansen P. Variable neighbor search for a extremal graphs. I. The AutoGraphiX system. Discrete Math. 212 (2000) 29-44
9. Caparossi G., and Hansen P. Variable neighbor search for a extremal graphs. V. Three ways to automate finding conjectures. Discrete Math. 276 (2004) 81-94
10. J. Cheeger, A lower bound for the smallest eigenvalue of the Laplacian, in: P.U.P. Gunning (Ed.), Probability in Analysis, 1970, pp. 195-199.
11. Chung F.R.K. Spectral graph Theory. CBMS vol. 92 (1997), American Mathematics Society
12. Chung F.R.K., Faber V., and Manteufffel T.A. An upper bound on the diameter of a graph from eigenvalues associated with its Laplacian. SIAM J. Discrete Math. 7 (1994) 443-457
13. D. Cvetković, Čangalović, V. Kovačević-Vujčić, Optimization and highly informative graph invariants, Tech. Report University Belgrade, 2002, pp. 1-31.
14. Cvetković D., Doob M., and Sachs H. Spectra of Graphs (1980), Academic Press
15. Cvetković D., Doob M., Gutman I., and Torgasev A. Recent Results in the Theory of Graph Spectra (1988), North-Holland, Amsterdam
16. D. Cvetković, L. Kraus, "Graph" an expert system for the classification and extension of knowledge in the field of graph theory, User Manual, Elektrothen. Fak., Beograd, 1983.
17. D. Cvetković, P. Rowlinson, S. Simić, Eigenspaces of graphs, EMA 66, Cambridge, 1997.
18. D. Cvetković, P. Rowlinson, S. Simić, Spectral Generalizations line graphs: On graphs with least eigenvalue -2, CUP, LNS, 314, 2004.
19. Cvetković D., and Simić S. Graph-theoretical results obtained by support of the expert system "graph". Bull. Acad. Serbe Sci. Arts 19 (1994) 19-41
20. Diestel R. Graph Theory (1997), Springer
21. Fallat S., and Kirkland S. Extremizing algebraic connectivity subject to graph theoretical constrains. Electron. J. Linear Algebra 3 (1998) 48-74.
22. Fallat S., Kirkland S., and Pati S. Minimizing algebraic connectivity over connected graphs with fixed girth. Discrete Math. 254 (2002) 115-142
23. Fallat S., Kirkland S., and Pati S. On graphs with algebraic connectivity equal to minimal edge density. Linear Algebra Appl. 273 (2003) 31-50
24. Fallat S., Kirkland S., and Pati S. Maximizing algebraic connectivity over unicyclic graphs. Linear and Multilinear Algebra 51 3 (2003) 221-241
25. Fiedler M. Algebraic Connectivity of Graphs. Czechoslovak Math. J. 23 (1973) 298-305
26. Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. J. 25 (1975) 607-618
27. Fiedler M. Absolute algebraic connectivity of trees. Linear and Multilinear Algebra 26 (1990) 85-106
28. Fiedler M. Some minimax problems for graphs. Discrete Math. 121 (1993) 65-74
29. A. Ghosh, S. Boyd, Upper bounds on algebraic connectivity via Convex Optimization, Thec. Report, Stanford University, 2003.
30. Godsil C., and Royle G. Algebraic Graph Theory. GTM vol. 207 (2001), Springer
31. Grone R., and Merris R. Algebraic connectivity of trees. Czechoslovak Math. J. 37 (1987) 660-670
32. Grone R., and Merris R. Cutpoints, lobes and spectra of graphs. Port. Math. 45 2 (1987) 181-187
33. Grone R., and Merris R. Ordering trees by algebraic connectivity. Graphs Combin. 6 (1990) 229-237
34. Grone R., Merris R., and Sunder V.S. The Laplacian Spectral of graphs. SIAM J. MAA 11 (1990) 218-239
35. Gross J., and Yellen J. Graph Theory and its Applications (2000), CRC Press
36. In: Gross J., and Yellen J. (Eds). Handbook of Graph Theory. Discrete Mathematics and its Applications (2004), CRC Press
37. Guo J.-M. The limit points of Laplacian spectral of graphs. Linear Algebra Appl. 362 (2003) 121-128
38. Hakimi S.L. An algorithm for construction of the least vulnerable communication network or the graph with the maximum connectivity. EEE Trans. Circ. Theory (1969) 229-230
39. Harary F. Graph Theory. third ed. (1972), Addison-Wesly Publishing Company
40. Hoffman A.J. On limit points of spectral radii of non-negative symmetric integral matrices. In: Alavi Y., et al. (Ed). Graph Theory and its Applications, LNM vol. 303 (1992), Springer-Verlag 165-172
41. Juhasz F. The asymptotic behavior of Fiedler's algebraic connectivity of graph. Discrete Math. 96 (1991) 59-63
42. Juvan M., and Mohar B. Optimal linear labelings and algebraic properties of graphs. Discrete Appl. Math. 36 2 (1992) 153-168
43. Kirkland S. A bound on the algebraic connectivity of a graph in terms of the number of cutpoints. Linear and Multilinear Algebra 47 (2000) 93-103
44. Kirkland S. An upper bound on the algebraic connectivity of graphs with many cutpoints. Eletron. J. Linear Algebra 8 (2001) 94-109
45. Kirkland S. A note on limit point for algebraic connectivity. Linear Algebra Appl. 373 (2003) 5-11
46. Kirkland S. Completion of Laplacian integral graphs via edge addition. Discrete Math. 295 (2005) 75-90
47. Kirkland S., Molitierno J., Neumann M., and Shader B. On graphs with equal algebraic and vertex connectivity. Linear Algebra Appl. 341 (2002) 45-56
48. Kirkland S., and Neumann M. Algebraic connectivity of weighted trees under perturbations. Linear Algebra Appl. 40 (1996) 187-203
49. Kirkland S., Neumann M., and Shader B. On a bound on algebraic connectivity: the case of equality. Czechoslovak Mathematical Journal 48 123 (1997) 65-77
50. Kirkland S., and Pati S. On the vertex connectivity and absolute algebraic connectivity for graphs. Linear and Multilinear Algebra 50 3 (2002) 253-284
51. C.E. Larson, Intelligent Machinery and Mathematical Discovery, Graph Theory Notes of New York, XLII, 2002, pp. 8-17.
52. Lima L.S., Abreu N.M.M., Moraes P.E., and Sertã C. Some properties of graphs in (a, b)-linear classes. Congr. Numer. 166 (2004) 43-51
53. L.S. Lima, N.M.M. Abreu, C.S. Oliveira, M. Aguieiras, Laplacian integral graphs in (a, b)-linear classes, Linear Algebra Appl., submitted for publication.
54. Maas C. Transportation in graphs and the admittance spectrum. Discrete Appl. Math. 16 (1987) 31-49
55. McKay B.D. On the spectral characteristic of trees. Ars. Combin. 3 (1977) 219-232
56. B.D. McKay, Nauty User's Guide (Version 1.5), Technical Report, TR-CS-90-02, Department of Computer Science, Australian National University, 1990.
57. McKay B.D. Isomorph-free exhaustive generation. J. Algorithms 26 (1998) 306-324
58. Merris R. Characteristic vertices of trees. Linear and Multilinear Algebra 22 (1987) 115-131
59. Merris R. Degree maximal graphs are Laplacian integral. Linear Algebra Appl. 199 (1994) 381-389
60. Merris R. Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197/198 (1994) 143-176
61. Merris R. A survey of graph Laplacian. Linear and Multilinear Algebra 39 (1995) 19-31
62. Merris R. Laplacian graph eigenvectors. Linear and Multilinear Algebra 278 (1998) 221-236
63. Mohar B. Eigenvalues, diameter and mean distance in graphs. Graphs Combin. 7 (1991) 53-64
64. B. Mohar, The Laplacian spectral of graphs, in: Y. Alavi, G. Chartrand, O.R. Oellermann, A.J. Schwenk (Eds.), Graph Theory Combinatorics and Applications, vol. 2, 1991, pp. 53-64.
65. Mohar B. Laplacian eigenvectors of a graph: a survey. Discrete Math. 109 (1992) 171-183
66. Mohar B., and Poljak S. Eigenvalues and the max-cut problem. Czech Math. J. 40 (1990) 343-352
67. Molitierno J.J. On the algebraic connectivity of graphs as a function of genus. Linear Algebra Appl. 419 (2006) 519-531
68. Molitierno J.J., Neumann, and Shader S. Tight bounds on the algebraic connectivity of a balanced binary tree. Eletron. J. Linear Algebra 6 (2000) 62-71
69. Oliveira C.S., Abreu N.M.M., and Pazoto A.F. Parameters of Connectivity in (a, b)-linear graphs. Eletron. Notes Discrete Math. 22 (2005) 189-193
70. Papadimitriou C.H., and Steiglitz K. Combinatorial Optimization: Algorithms and Complexity (1982), Prentice-Hall, INC.
71. Rojo O., and Medina L. Tight bounds on the algebraic connectivity of Bethe trees. Linear Algebra Appl. 418 (2006) 840-853
72. Shy L.Y., and Eichinger B.E. Large computational simulation and elast. Networks: Small eigenvalue and eigenvector spectral of the Kirchhoff matrix. J. Chem. Phys. 90 (1989) 5179-5189
73. D. Stevanović, V. Brankov, D. Cvetković, S. Simi,̧ newGRAPH, 2003, 2004. Available from .
74. Zhang X.-D. On the two conjectures of Graffiti. Linear Algebra Appl. 385 (2004) 369-379