Spanning Tree Results for Graphs and Multigraphs
A Matrix-Theoretic Approach
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 scientis…
Mehr
CHF 112.00
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
V104:
Folgt in ca. 10 Arbeitstagen
Produktdetails
Weitere Autoren: Gross, Daniel J / Suffel, Charles L
- ISBN: 978-981-45660-3-2
- EAN: 9789814566032
- Produktnummer: 20397842
- Verlag: Wspc
- Sprache: Englisch
- Erscheinungsjahr: 2014
- Seitenangabe: 188 S.
- Masse: H23.5 cm x B15.7 cm x D1.4 cm 433 g
- Abbildungen: HC gerader Rücken kaschiert
- Gewicht: 433
4 weitere Werke von John T Saccoman:
Bewertungen
Anmelden