Conte aos seus amigos sobre este item:
Spanning Tree Results for Graphs and Multigraphs: a Matrix-theoretic Approach Gross, Daniel J (Seton Hall University, USA)
Item sob encomenda (no estoque do fornecedor)
O que dizem nossos clientes:
Spanning Tree Results for Graphs and Multigraphs: a Matrix-theoretic Approach
Gross, Daniel J (Seton Hall University, 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
| Mídia | Livros Hardcover Book (Livro com lombada e capa dura) |
| Lançado | 23 de outubro de 2014 |
| ISBN13 | 9789814566032 |
| Editoras | World Scientific Publishing Co Pte Ltd |
| Páginas | 188 |
| Dimensões | 162 × 238 × 18 mm · 482 g |
| Idioma | Inglês |
![Cover for Marsh, Gerald E (Argonne National Laboratory (Retired), USA) · Force-free Magnetic Fields: Solutions, Topology and Applications (Hardcover Book) [Second edition] (2026)](https://imusic.b-cdn.net/images/item/original/948/9789819833948.jpg?marsh-gerald-e-argonne-national-laboratory-retired-usa-2026-force-free-magnetic-fields-solutions-topology-and-applications-hardcover-book&class=scaled&v=1786981299)