Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach (Hardcover)

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

Imprint:	World Scientific Publishing Co Pte Ltd
Country of origin:	Singapore
Release date:	October 2014
First published:	2015
Authors:	John T. Saccoman • Daniel J. Gross • Charles L. Suffel
Dimensions:	238 x 162 x 18mm (L x W x T)
Format:	Hardcover
Pages:	188
ISBN-13:	978-981-4566-03-2
Categories:	Books > Science & Mathematics > Mathematics > Mathematical foundations > General
LSN:	981-4566-03-9
Barcode:	9789814566032

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!