On the number of spanning trees and Eulerian tours in iterated line digraphs (Q674922): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:22, 30 January 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
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
