Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach

by John T. Saccoman, Charles L. Suffel, Daniel J. Gross

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...

• Format: Hardcover
• Language: English
• ISBN: 9814566039
• ISBN13: 9789814566032
• Release Date: October 2014
• Publisher: World Scientific Publishing Company
• Length: 188 Pages
• Weight: 1.05 lbs.
• Dimensions: 0.7" x 6.1" x 9.1"