• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Spanning Tree Results for Graphs and Multigraphs

Spanning Tree Results for Graphs and Multigraphs

Hardcover

General Mathematics

ISBN10: 9814566039
ISBN13: 9789814566032
Publisher: World Scientific Publishing Company
Published: Sep 14 2014
Pages: 188
Weight: 1.05
Height: 0.70 Width: 6.10 Depth: 9.10
Language: English

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.

Also in

General Mathematics