Spanning trees in directed circulant graphs and cycle power graphs

DOI10.1007/S00605-016-0912-2zbMATH Open1354.05027arXiv1507.02990OpenAlexW3098640870MaRDI QIDQ504113FDOQ504113

Authors: Justine Louis 

Publication date: 25 January 2017

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

Abstract: The number of spanning trees in a class of directed circulant graphs with generators depending linearly on the number of vertices $$, and in the $n$-th and $(n-1)$-th power graphs of the $$-cycle are evaluated as a product of $$ terms.

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

Recommendations

• On the number of spanning trees in directed circulant graphs
• The number of spanning trees in directed circulant graphs
• The numbers of spanning trees in undirected circulant graphs
• The number of spanning trees in circulant graphs
• On the number of spanning trees of circulant graphs
• Spanning trees in dense directed graphs
• Spanning trees of dense directed graphs
• The number of spanning trees in directed circulant graphs with non-fixed jumps
• On spanning cycles, paths and trees
• Cycles and spanning trees

zbMATH Keywords

spanning treecirculant graphcycle power graph

Mathematics Subject Classification ID

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

Cites Work

• A survey on multi-loop networks.
• A Course in Enumeration
• The asymptotic number of spanning trees in circulant graphs
• A complementary survey on double-loop networks
• 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
• 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
• Hajós' conjecture and cycle power graphs

Cited In (6)

• The number of spanning trees in directed circulant graphs
• A formula for the number of spanning trees in circulant graphs with nonfixed generators and discrete tori
• Directed cycles with two chords and strong spanning directed subgraphs with few arcs
• On the number of spanning trees in directed circulant graphs
• Title not available (Why is that?)
• Oriented spanning trees and stationary distribution of digraphs

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

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