Some Relations for Graphic Polynomials


Ivan Gutman


Let $G$ be a graph and $A$ and $B$ its two subgraphs with disjoint vertex sets. A number of results is obtained, relating the characteristic, matching and $\mu$-polunomials of $G$, $G$-$A$, $G$-$B$ and $G$-$A$-$B$.