On the number of spanning trees and Eulerian tours in iterated line digraphs
From MaRDI portal
Publication:674922
DOI10.1016/0166-218X(95)00118-BzbMATH Open0866.05028OpenAlexW2023008179MaRDI QIDQ674922FDOQ674922
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
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
- Line Digraph Iterations and the (d, k) Digraph Problem
- A Design for Directed Graphs with Minimum Diameter
- A new 5‐arc‐transitive cubic graph
- Title not available (Why is that?)
- On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
- Large fault-tolerant interconnection networks
- Title not available (Why is that?)
- Digraph categories and line digraph functors
- Title not available (Why is that?)
Cited In (13)
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
- Sandpile groups and spanning trees of directed line graphs
- The number of Euler tours of random directed graphs
- 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
- Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
- Error correcting sequence and projective de Bruijn graph
- The number of Euler tours of a random directed graph
- Traversing every edge in each direction once, but not at once: cubic (polyhedral) graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces
- Projective de Bruijn Sequences
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)
