Hosoya and Merrifield-Simmons indices of some classes of corona of two graphs
Let G = (V;E) be a simple graph of order n and size m. An r-matching of G is a set of r edges of G which no two of them have common vertex. The Hosoya index Z(G) of a graph G is defined as the total number of its matchings. An independent set of G is a set of vertices where no two vertices are adjac...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Isfahan
2012-12-01
|
Series: | Transactions on Combinatorics |
Subjects: | |
Online Access: | http://www.combinatorics.ir/?_action=showPDF&article=1946&_ob=cd7312d1a6cfa4ca813f40edc956c3c3&fileName=full_text.pdf. |