You might also like

More about Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach

• Book details
• Synopsis
• Trending among others

You get 203 loyalty points

Book synopsis

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.

Book details

Book category Books in English Mathematics & science Mathematics Mathematical foundations

• Full title: Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach
• Author: John T. Saccoman, Charles Suffel, Daniel J. Gross
• Language: English
• Binding: Hardback
• Number of pages: 188
• EAN: 9789814566032
• ISBN: 9814566039
• ID: 05071134
• Publisher: World Scientific Publishing Co Pte Ltd
• Weight: 482 g
• Dimensions: 238 × 162 × 18 mm
• Date of publishing: 23. October 2014

Trending among others

---

---

---