PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.) Vol. 52(66), pp. 59 (1992) 

Independent vertex sets in some compound graphsIvan GutmanPrirodnomatematicki fakultet, Kragujevac, YugoslaviaAbstract: Let $G$ be an $n$vertex graph and $R_1,R_2,\dots,R_n$ distinct rooted graphs. The compound graph $G[R_1,R_2,\dots,R_n]$ is obtained by identifying the root of $R_i$ with the $i$th vertex of $G$, $i=1,2,\dots,n$. We determine the number of independent vertex sets and the independence polynomial of $G[R_1,R_2,\dots,R_n]$. Several special cases of these results are pointed out. Classification (MSC2000): 05C70, 05C99 Full text of the article:
Electronic fulltext finalized on: 2 Nov 2001. This page was last modified: 16 Nov 2001.
© 2001 Mathematical Institute of the Serbian Academy of Science and Arts
