%0 Journal Article
%T Hosoya and Merrifield-Simmons indices of some classes of corona of two graphs
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A Reyhani, Mohammad Hossein
%A Alikhani, Saeid
%A Iranmanesh, Mohammad Ali
%D 2012
%\ 12/01/2012
%V 1
%N 4
%P 1-7
%! Hosoya and Merrifield-Simmons indices of some classes of corona of two graphs
%K matching
%K Hosoya
%K Merrifield-Simmons index
%K corona
%R 10.22108/toc.2012.1946
%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
Merrifield-Simmons index of $G$ is defined 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.
%U https://toc.ui.ac.ir/article_1946_94db2778225c932d0361b35eb33357ba.pdf