Abstract:We classify connected spanning convex subgraphs of the square cycles. We then show that every spanning tree of C 2 n is contained in a unique nontrivial connected spanning convex subgraph of C 2 n . As a result, we obtain a purely combinatorial derivation of the formula for the number of spanning trees of the square cycles.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.