Spanning trees in directed circulant graphs and cycle power graphs

DOI10.1007/s00605-016-0912-2zbMath1354.05027arXiv1507.02990OpenAlexW3098640870MaRDI QIDQ504113

Justine Louis

Publication date: 25 January 2017

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

spanning treecirculant graphcycle power graph

Mathematics Subject Classification ID

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

Cites Work

• Counting the number of spanning trees in a class of double fixed-step loop networks
• Further analysis of the number of spanning trees in circulant graphs
• The number of spanning trees in directed circulant graphs with non-fixed jumps
• Asymptotics for the number of spanning trees in circulant graphs and degenerating \(d\)-dimensional discrete tori
• The asymptotic number of spanning trees in circulant graphs
• Hajós' conjecture and cycle power graphs
• A survey on multi-loop networks.
• A Course in Enumeration
• A FORMULA FOR THE NUMBER OF SPANNING TREES IN CIRCULANT GRAPHS WITH NONFIXED GENERATORS AND DISCRETE TORI
• The number of spanning trees in a class of double fixed-step loop networks
• Star Extremal Circulant Graphs
• A complementary survey on double-loop networks

This page was built for publication: Spanning trees in directed circulant graphs and cycle power graphs