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

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

zbMATH Keywords

regular digraph

0 references

spanning trees

0 references

Eulerian tours

0 references

iterated line digraph

0 references

reviewed by

David P. Brown

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q3039368

0 references

Large fault-tolerant interconnection networks

0 references

A new 5‐arc‐transitive cubic graph

0 references

Q5636912

0 references

Line Digraph Iterations and the (d, k) Digraph Problem

0 references

Digraph categories and line digraph functors

0 references

Q3220617

0 references

A Design for Directed Graphs with Minimum Diameter

0 references

On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs

0 references

Identifiers

zbMATH Open document ID

0866.05028

0 references

DOI

10.1016/0166-218X(95)00118-B

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:674922

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