On graphs with algebraic connectivity equal to minimum edge density

Linear Algebra and Its Applications

Volumn 373, Issue SUPPL., 2003, Pages 31-50

  Fallat, Shaun M ^a   Kirkland, Steve ^a   Pati, Sukanta ^b  

^a UNIVERSITY OF REGINA   (Canada)

^b INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI   (India)

Author keywords

Algebraic connectivity; Edge cut; Edge density; Graphs; Laplacian matrix

Indexed keywords

LINEAR ALGEBRA; SET THEORY; THEOREM PROVING;

EDGE DENSITY;

GRAPH THEORY;

EID: 0141457905     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(02)00538-4     Document Type: Conference Paper

References (10)

1. Cvetković D., Doob M., Sachs H. Spectra of Graphs. 1980;Academic Press, New York.
2. Fallat S., Kirkland S. Perron components and algebraic connectivity for weighted graphs. Linear and Multilinear Algebra. 44:1998;131-148.
3. Fiedler M. Algebraic connectivity of graphs. Czechoslovak Math. J. 23:1973;298-305.
4. Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. J. 25:1975;607-618.
5. Grone R., Merris R., Sunder V.S. The Laplacian spectrum of a graph. SIAM J. Matrix Anal. Appl. 11:1990;218-238.
6. Horn R.A., Johnson C.R. Matrix Analysis. 1985;Cambridge University Press, New York.
7. Merris R. Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197&198:1994;143-176.
8. Merris R. A survey of graph Laplacians. Linear and Multilinear Algebra. 39:1995;19-31.
9. Mohar B. Eigenvalues, diameter, and mean distance in graphs. Graphs Combin. 7:1991;53-64.
10. Mohar B. Laplace eigenvalues of graphs - a survey. Discrete Math. 109:1992;171-183.