메뉴 건너뛰기




Volumn 162, Issue , 2014, Pages 415-420

The matching energy of graphs with given parameters

Author keywords

Chromatic number; Connectivity; Matching energy

Indexed keywords

ASYMPTOTIC RESULTS; CHROMATIC NUMBER; CONNECTED GRAPH; CONNECTIVITY; ENERGY OF A GRAPH; ENERGY OF GRAPHS; MATCHING ENERGY; MAXIMUM MATCHINGS;

EID: 84888012961     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2013.09.014     Document Type: Article
Times cited : (44)

References (13)
  • 4
    • 0002323724 scopus 로고
    • An introduction to matching polynomials
    • E.J. Farrell An introduction to matching polynomials J. Combin. Theory, Ser. B 27 1979 75 86
    • (1979) J. Combin. Theory, Ser. B , vol.27 , pp. 75-86
    • Farrell, E.J.1
  • 5
    • 0000668731 scopus 로고
    • On the theory of the matching polynomial
    • C.D. Godsil, and I. Gutman On the theory of the matching polynomial J. Graph Theory 5 1981 137 144
    • (1981) J. Graph Theory , vol.5 , pp. 137-144
    • Godsil, C.D.1    Gutman, I.2
  • 7
    • 0011983412 scopus 로고    scopus 로고
    • The energy of a graph: Old and new results
    • A. Betten, A. Kohnert, R. Laue, A. Wassermann, Springer-Verlag Berlin
    • I. Gutman The energy of a graph: old and new results A. Betten, A. Kohnert, R. Laue, A. Wassermann, Algebraic Combinatorics and Applications 2001 Springer-Verlag Berlin 196 211
    • (2001) Algebraic Combinatorics and Applications , pp. 196-211
    • Gutman, I.1
  • 8
    • 84889768519 scopus 로고    scopus 로고
    • Graph theory
    • M. Dehmer, F. Emmert-Streib, From Biology to Linguistics, Wiley-VCH Weinheim
    • I. Gutman, X. Li, and J. Zhang Graph theory M. Dehmer, F. Emmert-Streib, Analysis of Complex Networks 2009 From Biology to Linguistics, Wiley-VCH Weinheim 145 174
    • (2009) Analysis of Complex Networks , pp. 145-174
    • Gutman, I.1    Li, X.2    Zhang, J.3
  • 9
    • 84864753044 scopus 로고    scopus 로고
    • The matching energy of a graph
    • I. Gutman, and S. Wagner The matching energy of a graph Discrete Appl. Math. 160 2012 2177 2187
    • (2012) Discrete Appl. Math. , vol.160 , pp. 2177-2187
    • Gutman, I.1    Wagner, S.2
  • 11
    • 33845766647 scopus 로고    scopus 로고
    • On the upper bounds of the number of perfect matchings in graphs with given parameters
    • H. Lin, and X.F. Guo On the upper bounds of the number of perfect matchings in graphs with given parameters Acta Math. Appl. SIN-E 23 2007 155 160
    • (2007) Acta Math. Appl. SIN-E , vol.23 , pp. 155-160
    • Lin, H.1    Guo, X.F.2
  • 12
    • 84888013946 scopus 로고    scopus 로고
    • Extremal k-chromatic graphs with respect to Hosoya index and Merrifield-Simmons index
    • (in Chinese)
    • K.X. Xu Extremal k-chromatic graphs with respect to Hosoya index and Merrifield-Simmons index Journal of Xiamen University (Natural Science Version) 49 2010 312 315 (in Chinese)
    • (2010) Journal of Xiamen University (Natural Science Version) , vol.49 , pp. 312-315
    • Xu, K.X.1
  • 13
    • 80955149567 scopus 로고    scopus 로고
    • The Hosoya indices and Merrifield-Simmoms indices of the graphs with connectivity at most k
    • K.X. Xu, J.X. Li, and L.P. Zhong The Hosoya indices and Merrifield-Simmoms indices of the graphs with connectivity at most k Appl. Math. Lett. 25 2012 476 480
    • (2012) Appl. Math. Lett. , vol.25 , pp. 476-480
    • Xu, K.X.1    Li, J.X.2    Zhong, L.P.3


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