Spanning tree results for graphs and multigraphs : a matrix-theoretic approach /
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-theore...
Clasificación: | Libro Electrónico |
---|---|
Autores principales: | Gross, Daniel J. (Autor), Saccoman, John T. (Autor), Suffel, Charles L. (Autor) |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
New Jersey :
World Scientific,
[2014]
|
Temas: | |
Acceso en línea: | Texto completo |
Ejemplares similares
-
Introduction to [lambda]-trees /
por: Chiswell, Ian, 1948-
Publicado: (2001) -
Introduction to Lambda Trees.
por: Chiswell, Ian
Publicado: (2001) -
Algebraic graph theory : morphisms, monoids, and matrices /
por: Knauer, Ulrich, 1942-
Publicado: (2011) -
Expander families and Cayley graphs : a beginner's guide /
por: Krebs, Mike
Publicado: (2011) -
Understanding the shortest path first algorithm LiveLessons : networking talks /
por: Doyle, Jeff (Computer scientist)
Publicado: (2014)