The number of spanning trees in a class of double fixed-step loop networks (Q3528151): Difference between revisions

@@ Property / DOI @@
-.1002/net.20223
@@ Property / DOI: 10.1002/net.20223 / rank @@
-Normal rank
@@ Property / cites work @@
+Q4770409
@@ Property / cites work: Q4770409 / 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 @@
+Fault-tolerant routings in double fixed-step networks
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q5332459
@@ Property / cites work: Q5332459 / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of spanning trees in directed circulant graphs
+Normal rank
@@ Property / cites work @@
+Counting spanning trees in the graphs of Kleitman and Golden and a generalization
+Normal rank
@@ Property / cites work @@
+The number of spanning trees in circulant graphs
@@ Property / cites work: The number of spanning trees in circulant graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/NET.20223
@@ Property / DOI: 10.1002/NET.20223 / rank @@
+Normal rank