%0 Journal Article
%T Hosoya and Merrifield-Simmons indices of some classes of corona of two graphs
%A Mohammad Hossein Reyhani
%A Saeid Alikhani
%A Mohammad Ali Iranmanesh
%J Transactions on Combinatorics
%D 2012
%I University of Isfahan
%X 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 adjacent. The Merriffield-Simmons index of G is de¡¥ned as the total number of the independent sets of G. In this paper we obtain Hosoya and Merrifield-Simmons indices of corona of some graphs.
%K Matching
%K Hosoya
%K Merrifield-Simmons index
%K Corona
%U http://www.combinatorics.ir/?_action=showPDF&article=1946&_ob=cd7312d1a6cfa4ca813f40edc956c3c3&fileName=full_text.pdf.