This book is concerned with the optimization problem of maximizing the number of spanning trees of a multigraph. Since a spanning tree is a minimally connected subgraph, graphs and multigraphs having more of these are, in some sense, immune to disconnection by edge failure. We employ a matrix-theoretic approach to the calculation of the number of spanning trees.The authors envision this as a research aid that is of particular interest to graduate students or advanced undergraduate students and researchers in the area of network reliability theory. This would encompass graph theorists of all stripes, including mathematicians, computer scientists, electrical and computer engineers, and operations researchers.
- ISBN13 9789814566032
- Publish Date 23 October 2014 (first published 1 January 2014)
- Publish Status Active
- Publish Country SG
- Imprint World Scientific Publishing Co Pte Ltd
- Format Hardcover
- Pages 188
- Language English
- URL https://worldscientific.com/worldscibooks/10.1142/8963