메뉴 건너뛰기




Volumn 423, Issue 1, 2007, Pages 136-145

Laplacian integral graphs in S(a, b)

Author keywords

Algebraic connectivity; Edge connectivity; Hakimi extremal graph; Hakimi graph; Harary graph; Laplacian integral graphs; Vertex connectivity

Indexed keywords

GRAPH THEORY; INTEGRAL EQUATIONS; LINEAR ALGEBRA;

EID: 33947178010     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2006.12.004     Document Type: Article
Times cited : (11)

References (16)
  • 1
    • 0015476707 scopus 로고
    • Lower bounds on the vulnerability of a graph
    • Boesch F.T. Lower bounds on the vulnerability of a graph. Networks 2 (1972) 329-340
    • (1972) Networks , vol.2 , pp. 329-340
    • Boesch, F.T.1
  • 2
    • 77957101001 scopus 로고
    • Aggregation of inequalities in integer programming
    • Chvátal V., and Hammer P.L. Aggregation of inequalities in integer programming. Ann. Discrete Math. 1 (1977) 145-162
    • (1977) Ann. Discrete Math. , vol.1 , pp. 145-162
    • Chvátal, V.1    Hammer, P.L.2
  • 4
    • 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
  • 6
    • 0002395291 scopus 로고
    • The maximum connectivity of a graph
    • Harary F. The maximum connectivity of a graph. Proc. Natl. Acad. Sci. USA 48 (1962) 1142-1146
    • (1962) Proc. Natl. Acad. Sci. USA , vol.48 , pp. 1142-1146
    • Harary, F.1
  • 7
    • 0003780715 scopus 로고
    • Addison-Wesley Publishing Company, Inc
    • Harary F. Graph Theory (1969), Addison-Wesley Publishing Company, Inc
    • (1969) Graph Theory
    • Harary, F.1
  • 8
    • 33750694781 scopus 로고
    • An algorithm for construction of the least vulnerable communication network or the graph with the maximum connectivity
    • Hakimi S.L. An algorithm for construction of the least vulnerable communication network or the graph with the maximum connectivity. IEEE Trans. Circuit Theory (1969) 229-230
    • (1969) IEEE Trans. Circuit Theory , pp. 229-230
    • Hakimi, S.L.1
  • 10
    • 18544368356 scopus 로고    scopus 로고
    • Completition of Laplacian integral graphs via edge addition
    • Kirkland S. Completition of Laplacian integral graphs via edge addition. Discrete Math. 295 (2005) 75-90
    • (2005) Discrete Math. , vol.295 , pp. 75-90
    • Kirkland, S.1
  • 12
    • 21344494513 scopus 로고
    • Degree maximal graphs are Laplacian integral
    • Merris R. Degree maximal graphs are Laplacian integral. Linear Algebra Appl. 199 (1994) 381-389
    • (1994) Linear Algebra Appl. , vol.199 , pp. 381-389
    • Merris, R.1
  • 13
    • 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
  • 14
    • 0000011910 scopus 로고
    • Laplace eigenvalues of graphs: a survey
    • Mohar B. Laplace eigenvalues of graphs: a survey. Discrete Math. 109 (1992) 171-183
    • (1992) Discrete Math. , vol.109 , pp. 171-183
    • Mohar, B.1


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