An iteration method for computing the total number of spanning trees and its applications in graph theory (Q1686071): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2017.10.030
+Normal rank
@@ Property / OpenAlex ID @@
+W2767475077
@@ Property / OpenAlex ID: W2767475077 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic scale-free networks
@@ Property / cites work: Deterministic scale-free networks / rank @@
+Normal rank
@@ Property / cites work @@
+The average distances in random graphs with given expected degrees
+Normal rank
@@ Property / cites work @@
+Q3267900
@@ Property / cites work: Q3267900 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3165005
@@ Property / cites work: Q3165005 / rank @@
+Normal rank
@@ Property / cites work @@
+The number of spanning trees in Apollonian networks
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of spanning trees on various lattices
+Normal rank
@@ Property / cites work @@
+Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component
+Normal rank
@@ Property / cites work @@
+Spanning trees on the Sierpinski gasket
@@ Property / cites work: Spanning trees on the Sierpinski gasket / rank @@
+Normal rank
@@ Property / cites work @@
+Counting spanning trees in self-similar networks by evaluating determinants
+Normal rank
@@ Property / cites work @@
+Geometry of minimum spanning trees on scale-free networks
+Normal rank
@@ Property / cites work @@
+Loop-erased random walks, spanning trees and Hamiltonian cycles
+Normal rank
@@ Property / cites work @@
+Q2716030
@@ Property / cites work: Q2716030 / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE NORMALISED LAPLACIAN SPECTRUM, DEGREE-KIRCHHOFF INDEX AND SPANNING TREES OF GRAPHS
+Normal rank
@@ Property / cites work @@
+Spanning trees on graphs and lattices in<i>d</i>dimensions
+Normal rank
@@ Property / cites work @@
+New method for counting the number of spanning trees in a two-tree network
+Normal rank
@@ Property / cites work @@
+Enumeration of spanning trees in planar unclustered networks
+Normal rank
@@ Property / cites work @@
+On the spectrum of the normalized Laplacian of iterated triangulations of graphs
+Normal rank
@@ Property / cites work @@
+The normalized Laplacian spectrum of subdivisions of a graph
+Normal rank
@@ Property / cites work @@
+The number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs
+Normal rank
@@ Property / cites work @@
+On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs
+Normal rank