On the number of spanning trees in directed circulant graphs (Q2719844): Difference between revisions

@@ Property / DOI @@
-.1002/net.2
@@ Property / DOI: 10.1002/net.2 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.2
@@ Property / full work available at URL: https://doi.org/10.1002/net.2 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2127340552
@@ Property / OpenAlex ID: W2127340552 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning tree formulas and Chebyshev polynomials
@@ Property / cites work: Spanning tree formulas and Chebyshev polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Super Line-Connectivity Properties of Circulant Graphs
+Normal rank
@@ Property / cites work @@
+On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
+Normal rank
@@ Property / cites work @@
+Spanning trees in regular graphs
@@ Property / cites work: Spanning trees in regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Counting trees in directed regular multigraphs
@@ Property / cites work: Counting trees in directed regular multigraphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/NET.2
@@ Property / DOI: 10.1002/NET.2 / rank @@
+Normal rank