The Merrifield-Simmons Index and Hosoya Index of ð ¶ ( ð ‘›, 𠑘, 𠜆 ) Graphs

Shaojun Dai and Ruihai Zhang

Journal of Applied Mathematics, 2012, vol. 2012, 1-8

Abstract:

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 ð ¶ ( ð ‘› , 𠑘 , 𠜆 ) .

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2012/520156.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2012/520156.xml (text/xml)

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:hin:jnljam:520156

DOI: 10.1155/2012/520156

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().