Counting spanning trees in the graphs of Kleitman and Golden and a generalization

DOI10.1016/0016-0032(84)90054-1zbMath0569.05016OpenAlexW2059247311MaRDI QIDQ1061129

B. George

Publication date: 1984

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(84)90054-1

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Counting the number of spanning trees in a class of double fixed-step loop networks ⋮ Circulant blocks and rotational graphs ⋮ Coding and counting spanning trees in Kleitman-Golden graphs ⋮ The number of spanning trees in a class of double fixed-step loop networks ⋮ Cycles and spanning trees ⋮ An efficient approach for counting the number of spanning trees in circulant and related graphs ⋮ Counting trees in directed regular multigraphs

Cites Work

• Unnamed Item
• The Fibonacci numbers via trigonometric expressions
• Parallel concepts in graph theory
• Counting Trees in a Certain Class of Graphs
• Number fields