Spanning Tree Results for Graphs and Multigraphs
You save $10.26 USD (10%)
Format

Book Overview This book is concerned with the optimization problem of maximizing the number of spanning trees of a multigraph. Since a spanning tree is...
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.
Errata(s)
Book Details Format: Hardcover | Pages: 175 | Language: English | Publisher: WORLD SCIENTIFIC PUB CO INC | ISBN: 9814566039
Shipping & Returns Fast, reliable shipping and easy returns on eligible items.
Most orders ship within 1–2 business days with fast, reliable U.S. delivery.
Eligible items can be returned within 30 days in line with our store return policy.
Why shop with AlbakiReads
Sourced through trusted book distributors, with fresh titles added regularly.
Your payment information is encrypted and protected every step of the way.
Most orders ship within 1–2 business days.
From page-turners to timeless classics—find your next favorite read.