메뉴 건너뛰기




Volumn 18, Issue 1, 1997, Pages 35-48

Transformations of a graph increasing its Laplacian polynomial and number of spanning trees

Author keywords

[No Author keywords available]

Indexed keywords


EID: 21444442319     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1995.0077     Document Type: Article
Times cited : (12)

References (15)
  • 3
    • 0010944217 scopus 로고
    • Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimization design theory
    • C. Cheng, Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimization design theory, J. Combin. Theory, Ser. B, 31 (1981), 240-248.
    • (1981) J. Combin. Theory, Ser. B , vol.31 , pp. 240-248
    • Cheng, C.1
  • 7
    • 0040820990 scopus 로고
    • On properties of the characteristic polynomial of a graph
    • Gosenergoizdat, Moscow
    • A. K. Kelmans, On properties of the characteristic polynomial of a graph, in: Kibernetiku - Na Sluzbu Kommunizmu, 4, Gosenergoizdat, Moscow, 1967, pp. 27-41.
    • (1967) Kibernetiku - Na Sluzbu Kommunizmu , vol.4 , pp. 27-41
    • Kelmans, A.K.1
  • 8
    • 0041150047 scopus 로고
    • Comparison of graphs by their number of spanning trees
    • A. K. Kelmans, Comparison of graphs by their number of spanning trees, Discr. Math., 16 (1976), 241-261.
    • (1976) Discr. Math. , vol.16 , pp. 241-261
    • Kelmans, A.K.1
  • 9
    • 30244483318 scopus 로고
    • Operations on graphs that increase the number of their spanning trees
    • Nauka, Moscow
    • A. K. Kelmans, Operations on graphs that increase the number of their spanning trees, in: Issledovanie po Discretnoy Optimizacii, Nauka, Moscow, 1976, pp. 406-424.
    • (1976) Issledovanie po Discretnoy Optimizacii , pp. 406-424
    • Kelmans, A.K.1
  • 10
    • 0009070554 scopus 로고
    • The number of graph spanning trees containing a given forest
    • A. K. Kelmans, The number of graph spanning trees containing a given forest, Acta Math. Acad. Sci. Hungar., 27(1-2) (1976), 89-95.
    • (1976) Acta Math. Acad. Sci. Hungar. , vol.27 , Issue.1-2 , pp. 89-95
    • Kelmans, A.K.1
  • 11
    • 0039962900 scopus 로고
    • Graphs with extremal number of spanning trees
    • A. K. Kelmans, Graphs with extremal number of spanning trees, J. Graph Theory, 4 (1980), 119-122.
    • (1980) J. Graph Theory , vol.4 , pp. 119-122
    • Kelmans, A.K.1
  • 13
    • 30244513277 scopus 로고
    • Operations on graphs increasing their Laplacian polynomials
    • Rutgers University
    • A. K. Kelmans, Operations on graphs increasing their Laplacian polynomials, RUTCOR research Report 18-95, Rutgers University, 1995, pp. 1-17.
    • (1995) RUTCOR Research Report 18-95 , pp. 1-17
    • Kelmans, A.K.1
  • 14
    • 0040555950 scopus 로고
    • A certain polynomial of a graph and graphs with an extremal numbers of trees
    • A. K. Kelmans and V. M. Chelnokov, A certain polynomial of a graph and graphs with an extremal numbers of trees. J. Combin. Theory, Ser. B, 16 (1974), 197-214.
    • (1974) J. Combin. Theory, Ser. B , vol.16 , pp. 197-214
    • Kelmans, A.K.1    Chelnokov, V.M.2
  • 15
    • 4944257625 scopus 로고
    • Über die Auflösung der gleichungen, auf welche man bei der untersuchung der linearen Vertheilung galvanischer ströme geführt wird
    • G. Kirchhoff, Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird, Ann. Phys. Chem., 72 (1847), 497-508.
    • (1847) Ann. Phys. Chem. , vol.72 , pp. 497-508
    • Kirchhoff, G.1


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