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.
机构:
Nanjing Univ Aeronaut & Astronaut, Coll Sci, Nanjing, Jiangsu, Peoples R ChinaNanjing Univ Aeronaut & Astronaut, Coll Sci, Nanjing, Jiangsu, Peoples R China
Xu, Kexiang
Li, Jianxi
论文数: 0引用数: 0
h-index: 0
机构:
Zhangzhou Normal Univ, Dept Math & Informat Sci, Zhangzhou, Peoples R ChinaNanjing Univ Aeronaut & Astronaut, Coll Sci, Nanjing, Jiangsu, Peoples R China
Li, Jianxi
Zhong, Lingping
论文数: 0引用数: 0
h-index: 0
机构:
Nanjing Univ Aeronaut & Astronaut, Coll Sci, Nanjing, Jiangsu, Peoples R ChinaNanjing Univ Aeronaut & Astronaut, Coll Sci, Nanjing, Jiangsu, Peoples R China