Spanning Tree Results For Graphs And Multigraphs

A Matrix-theoretic Approach

By: John T Saccoman, Daniel J Gross, Charles L Suffel

Write A Review

Hardcover | 4 September 2014

At a Glance

Hardcover
188 Pages

Dimensions(cm)
22.86 x 15.24 x 1.27

Hardcover

RRP $153.99

$138.75

10%OFF

or 4 interest-free payments of $34.69 with

or

Ships in 15 to 25 business days

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.