On the spanning trees of the hypercube and other products of graphs

zbMath1267.05020arXiv1207.0896MaRDI QIDQ1953363

Olivier Bernardi

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypercubeenumerationindependence propertynumber of spanning treesproduct formulaidentification of factors

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Hypergraphs (05C65) Enumeration in graph theory (05C30) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

Characterisation and classification of signatures of spanning trees of the $n$-cube ⋮ The Goldman-Rota identity and the Grassmann scheme ⋮ A novel count of the spanning trees of a cube ⋮ Directed rooted forests in higher dimension ⋮ Laplacian matrices and spanning trees of tree graphs

This page was built for publication: On the spanning trees of the hypercube and other products of graphs