Mohlo by se vám také líbit

Více informací o knize Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 194 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Mathematics & science Mathematics Mathematical foundations

• Plný název: Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach
• Autor: John T. Saccoman, Charles Suffel, Daniel J. Gross
• Jazyk: Angličtina
• Vazba: Pevná
• Počet stran: 188
• EAN: 9789814566032
• ISBN: 9814566039
• ID: 05071134
• Nakladatelství: World Scientific Publishing Co Pte Ltd
• Hmotnost: 482 g
• Rozměry: 238 × 162 × 18 mm
• Datum vydání: 23. October 2014

Oblíbené z jiného soudku

---

---

---