Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2012, Article ID 520156, 8 pages
Research Article

The Merrifield-Simmons Index and Hosoya Index of 𝐢(𝑛,π‘˜,πœ†) Graphs

1Department of Mathematics, Tianjin Polytechnic University, No. 399 Binshuixi Road, Xiqing District, Tianjin 300387, China
2Department of Mathematics, Tianjin University of Science and Technology, Tianjin 300457, China

Received 29 May 2012; Revised 18 June 2012; Accepted 27 June 2012

Academic Editor: Ferenc Hartung

Copyright © 2012 Shaojun Dai and Ruihai Zhang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


The Merrifield-Simmons index 𝑖(𝐺) of a graph 𝐺 is defined as the number of subsets of the vertex set, in which any two vertices are nonadjacent, that is, the number of independent vertex sets of 𝐺 The Hosoya index 𝑧(𝐺) of a graph 𝐺 is defined as the total number of independent edge subsets, that is, the total number of its matchings. By 𝐢(𝑛,π‘˜,πœ†) we denote the set of graphs with 𝑛 vertices, π‘˜ cycles, the length of every cycle is πœ†, and all the edges not on the cycles are pendant edges which are attached to the same vertex. In this paper, we investigate the Merrifield-Simmons index 𝑖(𝐺) and the Hosoya index 𝑧(𝐺) for a graph 𝐺 in 𝐢(𝑛,π‘˜,πœ†).