Spanning Tree Results For Graphs And Multigraphs: A Matrix-Theoretic Approach - Hardcover

Gross, Daniel J

Hardcover

ISBN 10: 9814566039 ISBN 13: 9789814566032

Verlag: Wspc, 2014

Inhaltsangabe

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.

Über diesen Titel

Von der hinteren Coverseite

In this work, we consider the optimization problem of maximizing the number of spanning trees among graphs and multigraphs in the same class, i.e. having a fixed number of nodes and a fixed number of edges. 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.

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.

Details zur Ausgabe

• Verlag: Wspc
• Erscheinungsdatum: 2014
• Sprache: Englisch
• ISBN 10: 9814566039
• ISBN 13: 9789814566032
• Einband: Gebundene Ausgabe
• Anzahl der Seiten: 186
• Kontakt zum Hersteller: World Scientific Publishing; https://www.worldscientific.com/; ; 5 Toh Tuck Link; #01-01; 596224; Singapur
• Verantwortliche Person: Nicht verfügbar