Welcome to Loot.co.za! Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search

Checkout
- Your Cart Price

Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Mathematical foundations

Buy Now

Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach (Hardcover) Loot Price: R2,249

Discovery Miles 22 490

Repayment Terms: R211 pm x 12*

Add to cart

Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach (Hardcover): John T. Saccoman, Daniel J. Gross,...

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

John T. Saccoman, Daniel J. Gross, Charles L. Suffel

(sign in to rate)

Loot Price R2,249 Discovery Miles 22 490 | Repayment Terms: R211 pm x 12*

Expected to ship within 12 - 19 working days

Description
Details
Customer Reviews

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 Promotions
LSN:	981-4566-03-9
Barcode:	9789814566032