Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach
Seiten
2014
World Scientific Publishing Co Pte Ltd (Verlag)
978-981-4566-03-2 (ISBN)
World Scientific Publishing Co Pte Ltd (Verlag)
978-981-4566-03-2 (ISBN)
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.
Graph Theory Background; Matrix Theory Background, including Kroenecker Products, and Proofs of the Binet - Cauchy and Courant - Fischer Theorems; Spanning Tree Results for a Host of Graphs as well as Multigraphs; Node-Arc Incidence Matrix; Temperley's B Matrix. Multigraphs; Eigenvalues and Eigenvalue Bounds; A Lagrange Multiplier Approach to the Spanning Tree Problem.
Verlagsort | Singapore |
---|---|
Sprache | englisch |
Themenwelt | Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika |
ISBN-10 | 981-4566-03-9 / 9814566039 |
ISBN-13 | 978-981-4566-03-2 / 9789814566032 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
ein Übungsbuch für Fachhochschulen
Buch | Hardcover (2023)
Carl Hanser (Verlag)
16,99 €