On the number of spanning trees and Eulerian tours in iterated line digraphs (Q674922): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Fu Ji Zhang / rank
Normal rank
 
Property / author
 
Property / author: Qiong Xiang Huang / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: David P. Brown / rank
Normal rank
 
Property / author
 
Property / author: Fu Ji Zhang / rank
 
Normal rank
Property / author
 
Property / author: Qiong Xiang Huang / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: David P. Brown / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large fault-tolerant interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new 5‐arc‐transitive cubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line Digraph Iterations and the (d, k) Digraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph categories and line digraph functors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Design for Directed Graphs with Minimum Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023008179 / rank
 
Normal rank

Latest revision as of 10:13, 30 July 2024

scientific article
Language Label Description Also known as
English
On the number of spanning trees and Eulerian tours in iterated line digraphs
scientific article

    Statements

    On the number of spanning trees and Eulerian tours in iterated line digraphs (English)
    0 references
    0 references
    0 references
    0 references
    6 March 1997
    0 references
    Suppose \(D\) is a regular digraph. The authors establish the number of spanning trees and Eulerian tours of the iterated line digraph of \(D\) in terms of the number of spanning trees of \(D\). Some applications of these results are also included.
    0 references
    regular digraph
    0 references
    spanning trees
    0 references
    Eulerian tours
    0 references
    iterated line digraph
    0 references

    Identifiers