共 50 条
On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number
被引:27
|作者:
Xu, Kexiang
[1
]
机构:
[1] Nanjing Univ Aeronaut & Astronaut, Coll Sci, Nanjing 210016, Peoples R China
关键词:
Hosoya index;
Merrifield-Simmons index;
Clique number;
Chromatic number;
TREES;
(N;
N+1)-GRAPHS;
DIAMETER;
RESPECT;
D O I:
10.1016/j.aml.2009.11.005
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
The Hosoya index and the Merrifield-Simmons index of a graph are defined as the total number of the matchings (including the empty edge set) and the total number of the independent vertex sets (including the empty vertex set) of the graph, respectively. Let W(n,k) be the set of connected graphs with n vertices and clique number k. In this note we characterize the graphs from W(n,k) with extremal (maximal and minimal) Hosoya indices and the ones with extremal (maximal and minimal) Merrifield-Simmons indices, respectively. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码:395 / 398
页数:4
相关论文