The Merrifield‐Simmons Index and Hosoya Index of C(n, k, λ) Graphs

Shaojun Dai and Ruihai Zhang

Journal of Applied Mathematics, 2012, vol. 2012, issue 1

Abstract: The Merrifield‐Simmons index i(G) of a graph G 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 G The Hosoya index z(G) of a graph G is defined as the total number of independent edge subsets, that is, the total number of its matchings. By C(n, k, λ) we denote the set of graphs with n vertices, k 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 i(G) and the Hosoya index z(G) for a graph G in C(n, k, λ).

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2012/520156

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2012:y:2012:i:1:n:520156

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().