On the number of spanning trees and Eulerian tours in iterated line digraphs

DOI10.1016/0166-218X(95)00118-BzbMath0866.05028MaRDI QIDQ674922

Huaxiao Zhang, Qiong Xiang Huang, Fu Ji Zhang

Publication date: 6 March 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

regular digraph; spanning trees; iterated line digraph; Eulerian tours

Mathematics Subject Classification ID

05C05: Trees

05C30: Enumeration in graph theory

05C20: Directed graphs (digraphs), tournaments

Related Items

Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs, Sandpile groups and spanning trees of directed line graphs, Error correcting sequence and projective de Bruijn graph, Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs, Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs, A note on the number of spanning trees of line digraphs, Projective de Bruijn Sequences

Cites Work

• Large fault-tolerant interconnection networks
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
• Digraph categories and line digraph functors
• Line Digraph Iterations and the (d, k) Digraph Problem
• A Design for Directed Graphs with Minimum Diameter
• A new 5‐arc‐transitive cubic graph
• Unnamed Item
• Unnamed Item
• Unnamed Item