Title of article
Graphs with maximal Hosoya index and minimal Merrifield–Simmons index
Author/Authors
Zhu، نويسنده , , Zhongxun and Yuan، نويسنده , , Cao and Andriantiana، نويسنده , , Eric Ould Dadah and Wagner، نويسنده , , Stephan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2014
Pages
11
From page
77
To page
87
Abstract
For a graph G , the Hosoya index and the Merrifield–Simmons index are defined as the total number of its matchings and the total number of its independent sets, respectively. In this paper, we characterize the structure of those graphs that minimize the Merrifield–Simmons index and those that maximize the Hosoya index in two classes of simple connected graphs with n vertices: graphs with fixed matching number and graphs with fixed connectivity.
Keywords
Merrifield–Simmons index , Hosoya index , Vertex connectivity , matching number
Journal title
Discrete Mathematics
Serial Year
2014
Journal title
Discrete Mathematics
Record number
1600696
Link To Document