Cover of Saccoman John T Saccoman, Gross Daniel J Gross, Suffel Charles L Suffel: Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach

Saccoman John T Saccoman, Gross Daniel J Gross, Suffel Charles L Suffel Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach

Price for Eshop: 986 Kč (€ 39.4)

VAT 0% included

New

E-book delivered electronically online

E-Book information

World Scientific Publishing Company

2014

EPub, PDF
How do I buy e-book?

188

978-981-4566-05-6

981-4566-05-5

Annotation

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.

Ask question

You can ask us about this book and we'll send an answer to your e-mail.