Counting the spanning trees of the 3-cube using edge slides

MaRDI QIDQ2869470zbMATH OpenFDO

Authors Christopher Tuffley

Publication date 3 January 2014

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1109.6393

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Abstract: We give a direct combinatorial proof of the known fact that the 3-cube has 384 spanning trees, using an "edge slide" operation on spanning trees. This gives an answer in the case n=3 to a question implicitly raised by Stanley. Our argument also gives a bijective proof of the n=3 case of a weighted count of the spanning trees of the n-cube due to Martin and Reiner.

Recommendations

• The edge slide graph of the 3-cube
• On the spanning trees of the hypercube and other products of graphs
• Characterisation and classification of signatures of spanning trees of the \(n\)-cube
• Cubic graphs with minimum number of spanning trees.
• The number of spanning trees of the generalized Boolean \(n\)-cube network

Cited in

(3)

• On the spanning trees of the hypercube and other products of graphs
• The edge slide graph of the 3-cube
• Characterisation and classification of signatures of spanning trees of the \(n\)-cube

This page was built for publication: Counting the spanning trees of the 3-cube using edge slides

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869470)