Recomienda este artículo a tus amigos:
Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach Saccoman, John T (Seton Hall Univ, Usa)
Pedido desde almacén remoto
Nuestros clientes opinan:
Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach
Saccoman, John T (Seton Hall Univ, Usa)
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.
Readership: Graduate students and researchers in combinatorics and graph theory.
200 pages
| Medios de comunicación | Libros Hardcover Book (Libro con lomo y cubierta duros) |
| Publicado | 23 de octubre de 2014 |
| ISBN13 | 9789814566032 |
| Editores | World Scientific Publishing Co Pte Ltd |
| Páginas | 188 |
| Dimensiones | 162 × 238 × 18 mm · 482 g |
| Lengua | Inglés |
