Formulas counting spanning trees in line graphs and their extensions

Abstract

For any connected multigraph $G=(V,E)$ and any $M\subseteq E$, if $M$ induces an acyclic subgraph of $G$ and removing all edges in $M$ yields a subgraph of $G$ whose components are complete graphs, a formula for ${\tau }_G(M)$ is obtained, where ${\tau }_G(M)$ is the number of spanning trees in $G$ which contain all edges in $M$. Applying this result, we can easily obtain a formula for the number of spanning trees in the line graph or the middle graph of an arbitrary graph. Applying this result, we also show that for any connected graph $G$ with a clique $U$ which is a cut-set of $G$, the number of spanning trees in $G$ has a factorization which is analogous to a property of the chromatic polynomial of $G$.

26 pages, 9 figures and 18 references. Main results have been presented in Fuzhou University, Minan Normal University and Northwestern Polytechnical University