Let m(G, k) be the number of the k-matching of a graph G, z(G) denotes the Hosoya index of the graph G, then the Hosoya index of G is z(G) = Sigma(left perpendicularn/2right perpendicular)(k=0) m(G, k), where n denote the number of vertex of G. In this paper, the second largest Hosoya index of unicyclic graphs is determined.
机构:
Cent S Univ, Sch Math & Stat, New Campus, Changsha 410083, Hunan, Peoples R ChinaCent S Univ, Sch Math & Stat, New Campus, Changsha 410083, Hunan, Peoples R China
Liu, Weijun
Ban, Jingwen
论文数: 0引用数: 0
h-index: 0
机构:
Cent S Univ, Sch Math & Stat, New Campus, Changsha 410083, Hunan, Peoples R ChinaCent S Univ, Sch Math & Stat, New Campus, Changsha 410083, Hunan, Peoples R China
Ban, Jingwen
Feng, Lihua
论文数: 0引用数: 0
h-index: 0
机构:
Cent S Univ, Sch Math & Stat, New Campus, Changsha 410083, Hunan, Peoples R ChinaCent S Univ, Sch Math & Stat, New Campus, Changsha 410083, Hunan, Peoples R China
Feng, Lihua
Cheng, Tao
论文数: 0引用数: 0
h-index: 0
机构:
Shandong Normal Univ, Sch Math & Stat, Jinan 250014, Shandong, Peoples R ChinaCent S Univ, Sch Math & Stat, New Campus, Changsha 410083, Hunan, Peoples R China
Cheng, Tao
Emmert-Streib, Frank
论文数: 0引用数: 0
h-index: 0
机构:
Tampere Univ, Predict Soc & Data Analyt Lab, Fac Informat Technolgy & Commun Sci, Tampere 33100, FinlandCent S Univ, Sch Math & Stat, New Campus, Changsha 410083, Hunan, Peoples R China