|
Showing 1 - 1 of
1 matches in All Departments
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.
|
You may like...
Celebrations
Jan Kohler
Hardcover
R450
R351
Discovery Miles 3 510
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.