Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach
| By: | John T Saccoman; Daniel J Gross; Charles L Suffel |
| Publisher: | World Scientific Publishing |
| Print ISBN: | 9789814566032 |
| eText ISBN: | 9789814566056 |
| Edition: | 0 |
| Copyright: | 2015 |
| Format: | Reflowable |
eBook Features
Instant Access
Purchase and read your book immediately
Read Offline
Access your eTextbook anytime and anywhere
Study Tools
Built-in study tools like highlights and more
Read Aloud
Listen and follow along as Bookshelf reads to you
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.