The number of spanning trees of a graph with given matching number (Q5739584): Difference between revisions

@@ Property / cites work @@
+Upper bounds for the number of spanning trees of graphs
+Normal rank
@@ Property / cites work @@
+On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
+Normal rank
@@ Property / cites work @@
+Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
+Normal rank
@@ Property / cites work @@
+Q5691133
@@ Property / cites work: Q5691133 / rank @@
+Normal rank
@@ Property / cites work @@
+A sharp upper bound for the number of spanning trees of a graph
+Normal rank
@@ Property / cites work @@
+The number of spanning trees of a graph
@@ Property / cites work: The number of spanning trees of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Sharp upper bounds for the number of spanning trees of a graph
+Normal rank
@@ Property / cites work @@
+An upper bound for the number of spanning trees of a graph
+Normal rank
@@ Property / cites work @@
+A bound for the complexity of a simple graph
@@ Property / cites work: A bound for the complexity of a simple graph / rank @@
+Normal rank
@@ Property / cites work @@
+The Laplacian Spectrum of a Graph II
@@ Property / cites work: The Laplacian Spectrum of a Graph II / rank @@
+Normal rank
@@ Property / cites work @@
+Q4894608
@@ Property / cites work: Q4894608 / rank @@
+Normal rank
@@ Property / cites work @@
+The number of spanning trees of a graph
@@ Property / cites work: The number of spanning trees of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Laplacian graph eigenvectors
@@ Property / cites work: Laplacian graph eigenvectors / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
+Normal rank
@@ Property / cites work @@
+The number of spanning trees in some classes of graphs
+Normal rank
@@ Property / cites work @@
+The number of spanning forests of a graph
@@ Property / cites work: The number of spanning forests of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing the number of spanning trees of networks based on cycle basis representation
+Normal rank
@@ Property / cites work @@
+Maximizing the number of spanning trees on the (<i>p,</i><i>p</i>+2) graphs
+Normal rank