Omschrijving
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. br/br/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.boldContents:/bold bulletlist bulletAn Introduction to Relevant Graph Theory
Kenmerken
| Artikelnummer | 9200000034588272 |
|---|---|
| EAN | 9789814566056 |
| Categorie | Digital Reading |
| Productgroep | Boeken |
| Segment | Textual/Printed/Reference Materials |
| Prijs Nederland | € 33,40 |
| Prijs België | € 33,40 |
| Verzendkosten NL | Gratis |
| Verzendkosten BE | Gratis |
| Levertijd Nederland | Morgen in huis |
| Levertijd België | Morgen in huis |
| Verkoper | Partner |
Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach bestellen bij snelkeus
Koop Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach van Onbekend online in de categorie Digital Reading. Prijs € 33,40, levering in Nederland · Morgen in huis.