On the characterization of graphs with maximum number of spanning trees
Authors:
- L. PetingiLPL. Petingi
- F. BoeschFBF. Boesch
- C. SuffelCSC. Suffel
- 1 January 1998
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 179 (1-3) , 155-166
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A proof of Boesch's conjectureNetworks, 1994
- Laplacian matrices of graphs: a surveyLinear Algebra and its Applications, 1994
- On the existence of uniformly optimally reliable networksNetworks, 1991
- Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimum design theoryJournal of Combinatorial Theory, Series B, 1981
- Comparison of graphs by their number of spanning treesDiscrete Mathematics, 1976
- A certain polynomial of a graph and graphs with an extremal number of treesJournal of Combinatorial Theory, Series B, 1974