Home › Graphic Methods › Spanning Tree Results for Graphs and Multigraphs

Spanning Tree Results for Graphs and Multigraphs

by Saccoman John T Publisher: WORLD SCIENTIFIC PUB CO INC

Counting spanning trees through matrices

Regular price $89.55 USD
Regular price $99.50 USD Sale price $89.55 USD
Save 10%

Hardcover New English

In stock · Dispatches in 1–2 business days
Delivery to your door
In stock·Dispatches in 1–2 business days
Standard shipping* from $4.35
Standard shipping transit* 5–8 business days after dispatch

Faster options are available.

Rates and delivery estimates depend on your destination and item quantity. Estimates are informational only; the final shipping method and rate are selected at checkout.

Secure checkout
American Express Apple Pay DiscoverGoogle Pay Mastercard PayPalVisa
30-day eligible returns Returns & refunds policy

AlbakiReads Editorial

Counting spanning trees through matrices

This mathematics text examines how to maximize the number of spanning trees in graphs and multigraphs. It approaches the counting problem through matrix theory, connecting a graph’s supply of minimally connected subgraphs with the question of how well a network can withstand edge failures. The subject places the book at the intersection of graph theory and network reliability, with the central task being both combinatorial—counting spanning trees—and optimization-focused. Its scope is specialized, centered on a defined problem rather than a broad introduction to graph theory.

Good fit for readers who enjoy

  • Graduate students and advanced undergraduates studying graph theory or network reliability.
  • Researchers and practitioners in mathematics, computer science, electrical or computer engineering, and operations research.

Themes

Spanning-tree enumerationMatrix methods in graph theoryNetwork reliability and edge failure

Based on publisher information and book metadata.

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 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)

Shipping & returnsShipping options, delivery timing, and our return policy.

In-stock items normally dispatch within 1–2 business days. The ZIP-code estimator on this page is informational only; the final shipping method, price, and availability are confirmed at checkout for your full order.

For the initial delivery estimate we use these transit windows after dispatch: Standard 5–8 business days, Expedited 2–4 business days, and Priority 1–2 business days. Holiday delays are not included.

Eligible items can be returned within 30 days in accordance with our return policy.

Customer reviews

M
AlbakiReads
Malaika Taylor

I highly recommend to for anyone looking for inner clarity

T
AlbakiReads
Thomas DiMassa

Great service and fast service

Great shopping experience! The book arrived quickly, was well packaged, and matched the description perfectly. I would definitely shop with you again

O
AlbakiReads
Olivia

Smooth.