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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
