Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach - Saccoman, John T (Seton Hall Univ, Usa) - Books - World Scientific Publishing Co Pte Ltd - 9789814566032 - October 23, 2014
In case cover and title do not match, the title is correct

Saccoman, John T (Seton Hall Univ, Usa)
Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach

Price
HK$ 699
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Jul 29 - Aug 4
Get notified about new Saccoman, John T (Seton Hall Univ, Usa) releases

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Not rated yet

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.

Readership: Graduate students and researchers in combinatorics and graph theory.

200 pages

Media Books     Hardcover Book   (Book with hard spine and cover)
Released October 23, 2014
ISBN13 9789814566032
Publishers World Scientific Publishing Co Pte Ltd
Pages 188
Dimensions 162 × 238 × 18 mm   ·   482 g
Language English  

More from the same publisher

See all of Saccoman, John T (Seton Hall Univ, Usa) ( e.g. Hardcover Book )