
Shipping Estimate
USA
- USA
- CAN
- USA
- CAN
Ships within 48 hours · Estimated delivery Jul 5 - Jul 10
For Your Every Summer RSVP, with Code: SUMMER15
Description
Spanning Tree Results for Graphs and MultigraphsThis 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
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.
Errata(s)
Shipping Notes
- Free Standard Shipping on $100+ Orders to the USA.
- Except Preorder products are shipped in 48 hours.
- Delivery to the USA:
- Standard Shipping : 3-10 business days
- If time is of the essence, please consider selecting expedited delivery for faster service.
Exchange/Return Notes
- We offer a 30-day return/exchange service after receiving.
- Final sale items are not eligible for returns or exchanges.
- To process your return/exchange, please contact us at [email protected]
- Please click here for more details>>> Return & Exchange Policy