Undirected simple connected graphs with minimum number of spanning trees (Q1025924): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2008.08.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2054979463
@@ Property / OpenAlex ID: W2054979463 / rank @@
+Normal rank
@@ Property / cites work @@
+Least reliable networks and the reliability domination
+Normal rank
@@ Property / cites work @@
+On the characterization of graphs with maximum number of spanning trees
+Normal rank
@@ Property / cites work @@
+Network transformations and bounding network reliability
+Normal rank
@@ Property / cites work @@
+Q2716030
@@ Property / cites work: Q2716030 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+On graphs with randomly deleted edges
@@ Property / cites work: On graphs with randomly deleted edges / rank @@
+Normal rank
@@ Property / cites work @@
+Q4894608
@@ Property / cites work: Q4894608 / rank @@
+Normal rank
@@ Property / cites work @@
+A certain polynomial of a graph and graphs with an extremal number of trees
+Normal rank
@@ Property / cites work @@
+Q4435806
@@ Property / cites work: Q4435806 / rank @@
+Normal rank
@@ Property / cites work @@
+Threshold graphs and related topics
@@ Property / cites work: Threshold graphs and related topics / rank @@
+Normal rank
@@ Property / cites work @@
+A reliability-improving graph transformation with applications to network reliability
+Normal rank
@@ Property / cites work @@
+A new technique for the characterization of graphs with a maximum number of spanning trees
+Normal rank