Online Library TheLib.net » Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach
cover of the book Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach

Ebook: Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach

00
27.01.2024
0
0
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.

Download the book Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach for free or read online
Read Download
Continue reading on any device:
QR code
Last viewed books
Related books
Comments (0)
reload, if the code cannot be seen