Merrifield–Simmons index;
Hosoya index;
tree;
pendant vertex;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
The Merrifield–Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we characterize the trees with maximal Merrifield–Simmons indices and minimal Hosoya indices, respectively, among the trees with k pendant vertices.
机构:
Univ Stellenbosch, Div Math, Dept Math Sci, ZA-7602 Matieland, South AfricaUniv Stellenbosch, Div Math, Dept Math Sci, ZA-7602 Matieland, South Africa
机构:
Huaiyin Inst Technol, Fac Math & Phys, Huaian City 223003, Peoples R ChinaHuaiyin Inst Technol, Fac Math & Phys, Huaian City 223003, Peoples R China
Hua, Hongbo
Wang, Maolin
论文数: 0引用数: 0
h-index: 0
机构:
Huaiyin Inst Technol, Fac Math & Phys, Huaian City 223003, Peoples R ChinaHuaiyin Inst Technol, Fac Math & Phys, Huaian City 223003, Peoples R China
机构:
Tarbiat Modares Univ, Fac Math Sci, Dept Math, POB 14115-137, Tehran, IranTarbiat Modares Univ, Fac Math Sci, Dept Math, POB 14115-137, Tehran, Iran
Hamzeh, A.
论文数: 引用数:
h-index:
机构:
Iranmanesh, A.
Hossein-Zadeh, S.
论文数: 0引用数: 0
h-index: 0
机构:
Tarbiat Modares Univ, Fac Math Sci, Dept Math, POB 14115-137, Tehran, IranTarbiat Modares Univ, Fac Math Sci, Dept Math, POB 14115-137, Tehran, Iran