메뉴 건너뛰기




Volumn 420, Issue 2-3, 2007, Pages 400-406

Lower bounds of the Laplacian spectrum of graphs based on diameter

Author keywords

Algebraic connectivity; Diameter; Laplacian spectral radius

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LINEAR ALGEBRA; MATHEMATICAL OPERATORS;

EID: 33750983041     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2006.07.023     Document Type: Article
Times cited : (26)

References (13)
  • 1
    • 33750994100 scopus 로고
    • 1, isoperimetric inequalities for graphs and superconcentrators
    • 1, isoperimetric inequalities for graphs and superconcentrators. J. Combin. Theory Ser. B 38 (1985) 73-88
    • (1985) J. Combin. Theory Ser. B , vol.38 , pp. 73-88
    • Alon, N.1    Milman, V.D.2
  • 2
    • 0001350119 scopus 로고
    • Algebraic connectivity of graphs
    • Fiedler M. Algebraic connectivity of graphs. Czechoslovak Math. J. 23 (1973) 298-305
    • (1973) Czechoslovak Math. J. , vol.23 , pp. 298-305
    • Fiedler, M.1
  • 3
    • 0000827674 scopus 로고
    • A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
    • Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. J. 25 (1975) 619-633
    • (1975) Czechoslovak Math. J. , vol.25 , pp. 619-633
    • Fiedler, M.1
  • 4
    • 84968468352 scopus 로고
    • Diameters and eigenvalues
    • Chung F.R.K. Diameters and eigenvalues. J. Amer. Math. Soc. 2 (1989) 187-196
    • (1989) J. Amer. Math. Soc. , vol.2 , pp. 187-196
    • Chung, F.R.K.1
  • 5
    • 0001180385 scopus 로고
    • Algebraic connectivity of trees
    • Grone R., and Merris R. Algebraic connectivity of trees. Czechoslovak Math. J. 37 (1987) 660-670
    • (1987) Czechoslovak Math. J. , vol.37 , pp. 660-670
    • Grone, R.1    Merris, R.2
  • 7
    • 0042066025 scopus 로고    scopus 로고
    • A bound on algebraic connectivity of a graph in terms of the number of cutpoints
    • Kirkland S. A bound on algebraic connectivity of a graph in terms of the number of cutpoints. Linear and Multilinear Algebra 47 (2000) 93-103
    • (2000) Linear and Multilinear Algebra , vol.47 , pp. 93-103
    • Kirkland, S.1
  • 8
    • 0012946402 scopus 로고    scopus 로고
    • On the Laplacian eigenvalues of a graph
    • Li J.S., and Zhang X.D. On the Laplacian eigenvalues of a graph. Linear Algebra Appl. 285 (1998) 305-307
    • (1998) Linear Algebra Appl. , vol.285 , pp. 305-307
    • Li, J.S.1    Zhang, X.D.2
  • 9
    • 0002161806 scopus 로고
    • Characteristic vertices of trees
    • Merris R. Characteristic vertices of trees. Linear and Multilinear Algebra 22 (1987) 115-131
    • (1987) Linear and Multilinear Algebra , vol.22 , pp. 115-131
    • Merris, R.1
  • 10
    • 33750999449 scopus 로고
    • Laplacian matrices of graphs: a survey
    • Merris R. Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197-198 (1994) 143-176
    • (1994) Linear Algebra Appl. , vol.197-198 , pp. 143-176
    • Merris, R.1
  • 11
    • 0040122438 scopus 로고    scopus 로고
    • A note on Laplacian graph eigenvalues
    • Merris R. A note on Laplacian graph eigenvalues. Linear Algebra Appl. 285 (1998) 33-35
    • (1998) Linear Algebra Appl. , vol.285 , pp. 33-35
    • Merris, R.1
  • 12
    • 0002427040 scopus 로고
    • Eigenvalues, diameter, and mean distance in graphs
    • Mohar B. Eigenvalues, diameter, and mean distance in graphs. Graphs Combin. 7 (1991) 53-64
    • (1991) Graphs Combin. , vol.7 , pp. 53-64
    • Mohar, B.1
  • 13
    • 0034380563 scopus 로고    scopus 로고
    • An always non-trivial upper bound for Laplacian graph eigenvalues
    • Rojo O., Soto R., and Rojo H. An always non-trivial upper bound for Laplacian graph eigenvalues. Linear Algebra Appl. 312 (2000) 155-159
    • (2000) Linear Algebra Appl. , vol.312 , pp. 155-159
    • Rojo, O.1    Soto, R.2    Rojo, H.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.