Share
Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach (in English)
John T Saccoman; Daniel J Gross; Charles L Suffel (Author)
·
Wspc
· Paperback
Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach (in English) - John T Saccoman; Daniel J Gross; Charles L Suffel
$ 80.53
$ 85.00
You save: $ 4.47
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My WishlistsIt will be shipped from our warehouse between
Wednesday, May 29 and
Thursday, May 30.
You will receive it anywhere in United States between 1 and 3 business days after shipment.
Synopsis "Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach (in English)"
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)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.
✓ Producto agregado correctamente al carro, Ir a Pagar.
