Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory (Q1159692): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4770409
@@ Property / cites work: Q4770409 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimality of certain asymmetrical experimental designs
+Normal rank
@@ Property / cites work @@
+Q4192840
@@ Property / cites work: Q4192840 / rank @@
+Normal rank
@@ Property / cites work @@
+Transformations of a graph increasing its Laplacian polynomial and number of spanning trees
+Normal rank
@@ Property / cites work @@
+A certain polynomial of a graph and graphs with an extremal number of trees
+Normal rank
@@ Property / cites work @@
+On the Nonrandomized Optimality and Randomized Nonoptimality of Symmetrical Designs
+Normal rank
@@ Property / cites work @@
+Q4072671
@@ Property / cites work: Q4072671 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing the number of spanning trees in a graph with n nodes and m edges
+Normal rank
@@ Property / cites work @@
+Q3288481
@@ Property / cites work: Q3288481 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0095-8956(81)80028-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2005962499
@@ Property / OpenAlex ID: W2005962499 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1159692