Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach
Regular price
€83.99
A01=Charles L Suffel
A01=Daniel J Gross
A01=John T Saccoman
Author_Charles L Suffel
Author_Daniel J Gross
Author_John T Saccoman
Category=PBC
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Laplacian Matrix
Matrix Techniques
Multigraphs
Optimization
Spanning Trees
Product details
- ISBN 9789814566032
- Publication Date: 23 Oct 2014
- Publisher: World Scientific Publishing Co Pte Ltd
- Publication City/Country: SG
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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.
