Upper bounds for the number of spanning trees of graphs (Q387931): Difference between revisions

@@ 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 @@
+A sharp upper bound for the number of spanning trees of a graph
+Normal rank
@@ Property / cites work @@
+Sharp upper bounds 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 @@
+Bounds on Randić indices
@@ Property / cites work: Bounds on Randić indices / rank @@
+Normal rank
@@ Property / cites work @@
+Determinants with Elements ± 1
@@ Property / cites work: Determinants with Elements ± 1 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1186/1029-242x-2012-269
+Normal rank
@@ Property / OpenAlex ID @@
+W2098775683
@@ Property / OpenAlex ID: W2098775683 / rank @@
+Normal rank