On the number of spanning trees and Eulerian tours in iterated line digraphs (Q674922)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of spanning trees and Eulerian tours in iterated line digraphs |
scientific article; zbMATH DE number 987769
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of spanning trees and Eulerian tours in iterated line digraphs |
scientific article; zbMATH DE number 987769 |
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
0.9190449
0 references
0.91591877
0 references
0.9054726
0 references
0.90366805
0 references
0.90222836
0 references
0.89505386
0 references
0.89414877
0 references
0.8940519
0 references
