Journal of Graph Theory · 2016 · 35 citations · 8 references
Natural SciencesMathematicsCircuit TheoryCombinatoricsComputational GeometryCombinatorial EnumerationEnumerative CombinatoricsGraph TheoryLine Graphs
Abstract For any graph G , let be the number of spanning trees of G , be the line graph of G , and for any nonnegative integer r , be the graph obtained from G by replacing each edge e by a path of length connecting the two ends of e . In this article, we obtain an expression for in terms of spanning trees of G by a combinatorial approach. This result generalizes some known results on the relation between and and gives an explicit expression if G is of order and size in which s vertices are of degree 1 and the others are of degree k . Thus we prove a conjecture on for such a graph G .
8
Oriented subtrees of an arc digraph
Donald E. Knuth · Journal of Combinatorial Theory · 1967 · 31 citations
The Critical Group of a Line Graph
Andrew Berget, Andrew Manion, Molly Maxwell et al. · Annals of Combinatorics · 2012 · 30 citations