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

← Older edit

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / 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
@@ Property / Recommended article @@
+Q4781519
@@ Property / Recommended article: Q4781519 / rank @@
+Normal rank
@@ Property / Recommended article: Q4781519 / qualifier @@
+Similarity Score: 0.95228434Amount 0.95228434
Unit 1
-Amount
+.95228434
 Unit
@@ Property / Recommended article: Q4781519 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A note on the number of spanning trees of line digraphs
+Normal rank
+Similarity Score: 0.9190449Amount 0.9190449
Unit 1
-Amount
+.9190449
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
+Normal rank
+Similarity Score: 0.91591877Amount 0.91591877
Unit 1
-Amount
+.91591877
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
+Normal rank
+Similarity Score: 0.9054726Amount 0.9054726
Unit 1
-Amount
+.9054726
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4510803
@@ Property / Recommended article: Q4510803 / rank @@
+Normal rank
@@ Property / Recommended article: Q4510803 / qualifier @@
+Similarity Score: 0.9038496Amount 0.9038496
Unit 1
-Amount
+.9038496
 Unit
@@ Property / Recommended article: Q4510803 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Counting Euler Tours in Undirected Bounded Treewidth Graphs
+Normal rank
+Similarity Score: 0.90366805Amount 0.90366805
Unit 1
-Amount
+.90366805
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Bounding the number of Eulerian tours in undirected graphs
+Normal rank
+Similarity Score: 0.90222836Amount 0.90222836
Unit 1
-Amount
+.90222836
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On the number of spanning trees of some irregular line graphs
+Normal rank
+Similarity Score: 0.89505386Amount 0.89505386
Unit 1
-Amount
+.89505386
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Trees and Euler Tours in a Planar Graph and its Relatives
+Normal rank
+Similarity Score: 0.89414877Amount 0.89414877
Unit 1
-Amount
+.89414877
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On the number of spanning trees of circulant graphs
+Normal rank
+Similarity Score: 0.8940519Amount 0.8940519
Unit 1
-Amount
+.8940519
 Unit
+Recommender Run: Recommender Run 2

Latest revision as of 12:39, 4 April 2025

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

instance of

scholarly article

0 references

title

On the number of spanning trees and Eulerian tours in iterated line digraphs (English)

0 references

0 references

0 references

0 references

Discrete Applied Mathematics

0 references

publication date

6 March 1997

0 references

full work available at URL

http://www.elsevier.com/locate/dam

0 references

review text

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