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

DOI10.1016/0166-218X(95)00118-BMaRDI QIDQ674922zbMATH OpenOpenAlexFDO

Authors Hua Xiao Zhang, Fuji Zhang, Qiongxiang Huang

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

spanning treesregular digraphiterated line digraphEulerian tours

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30)

Recommendations

• scientific article; zbMATH DE number 1827742
• A note on the number of spanning trees of line digraphs
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
• scientific article; zbMATH DE number 1522568
• Counting Euler tours in undirected bounded treewidth graphs
• Bounding the number of Eulerian tours in undirected graphs
• On the number of spanning trees of some irregular line graphs
• Trees and Euler Tours in a Planar Graph and its Relatives
• On the number of spanning trees of circulant graphs

Cites work

• scientific article; zbMATH DE number 3831957 (Why is no real title available?)
• scientific article; zbMATH DE number 3885939 (Why is no real title available?)
• scientific article; zbMATH DE number 3363588 (Why is no real title available?)
• A Design for Directed Graphs with Minimum Diameter
• A new 5‐arc‐transitive cubic graph
• Digraph categories and line digraph functors
• Large fault-tolerant interconnection networks
• Line Digraph Iterations and the (d, k) Digraph Problem
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs

Cited in

(13)

• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
• The number of Euler tours of random directed graphs
• The number of Euler tours of a random directed graph
• Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
• Projective de Bruijn Sequences
• Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
• A note on the number of spanning trees of line digraphs
• Sandpile groups and spanning trees of directed line graphs
• Error correcting sequence and projective de Bruijn graph
• Traversing every edge in each direction once, but not at once: cubic (polyhedral) graphs
• scientific article; zbMATH DE number 1522568 (Why is no real title available?)
• scientific article; zbMATH DE number 1827742 (Why is no real title available?)

This page was built for publication: On the number of spanning trees and Eulerian tours in iterated line digraphs

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