On the characterization of graphs with maximum number of spanning trees (Q1377718): Difference between revisions

Latest revision as of 09:31, 28 May 2024

scientific article

Language	Label	Description	Also known as
English	On the characterization of graphs with maximum number of spanning trees	scientific article

Statements

instance of

scholarly article

0 references

title

On the characterization of graphs with maximum number of spanning trees (English)

0 references

published in

Discrete Mathematics

0 references

publication date

14 September 1998

0 references

review text

A number of results are proved with respect to so-called \(t\)-optimal graphs, i.e. graphs which have the maximum number of spanning trees among all graphs with the same number of nodes and edges.

0 references

zbMATH Keywords

spanning trees

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Q4770409

0 references

On the existence of uniformly optimally reliable networks

0 references

Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory

0 references

Parallel concepts in graph theory

0 references

A certain polynomial of a graph and graphs with an extremal number of trees

0 references

Comparison of graphs by their number of spanning trees

0 references

Laplacian matrices of graphs: A survey

0 references

Maximizing the number of spanning trees in a graph with n nodes and m edges

0 references

A proof of Boesch's conjecture

0 references

Identifiers

zbMATH Open document ID

0895.05052

0 references

DOI

10.1016/S0012-365X(97)00034-4

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1377718

@@ Property / author @@
-Louis Petingi
@@ Property / author: Louis Petingi / rank @@
-Normal rank
@@ Property / author @@
-F. T. Boesch
@@ Property / author: F. T. Boesch / rank @@
-Normal rank
@@ Property / author @@
-Charles L. Suffel
@@ Property / author: Charles L. Suffel / rank @@
-Normal rank
@@ Property / reviewed by @@
-Peter Kirschenhofer
@@ Property / reviewed by: Peter Kirschenhofer / rank @@
-Normal rank
@@ Property / author @@
+Louis Petingi
@@ Property / author: Louis Petingi / rank @@
+Normal rank
@@ Property / author @@
+F. T. Boesch
@@ Property / author: F. T. Boesch / rank @@
+Normal rank
@@ Property / author @@
+Charles L. Suffel
@@ Property / author: Charles L. Suffel / rank @@
+Normal rank
@@ Property / reviewed by @@
+Peter Kirschenhofer
@@ Property / reviewed by: Peter Kirschenhofer / rank @@
+Normal rank
@@ 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 @@
+On the existence of uniformly optimally reliable networks
+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 @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / 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 @@
+Comparison of graphs by their number of spanning trees
+Normal rank
@@ Property / cites work @@
+Laplacian matrices of graphs: A survey
@@ Property / cites work: Laplacian matrices of graphs: A survey / 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 @@
+A proof of Boesch's conjecture
@@ Property / cites work: A proof of Boesch's conjecture / rank @@
+Normal rank