Cantitate/Preț
Produs

Spanning Tree Results for Graphs and Multigraphs

Autor John T. Saccoman, Charles Suffel, Daniel J. Gross
en Limba Engleză Hardback – 22 oct 2014
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)
Citește tot Restrânge

Preț: 49133 lei

Preț vechi: 57803 lei
-15% Nou

Puncte Express: 737

Preț estimativ în valută:
9406 9777$ 7799£

Carte tipărită la comandă

Livrare economică 05-19 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9789814566032
ISBN-10: 9814566039
Pagini: 188
Dimensiuni: 155 x 231 x 18 mm
Greutate: 0.48 kg
Editura: WORLD SCIENTIFIC

Cuprins

Graph Theory Background; Matrix Theory Background, including Kroenecker Products, and Proofs of the Binet - Cauchy and Courant - Fischer Theorems; Spanning Tree Results for a Host of Graphs as well as Multigraphs; Node-Arc Incidence Matrix; Temperley's B Matrix. Multigraphs; Eigenvalues and Eigenvalue Bounds; A Lagrange Multiplier Approach to the Spanning Tree Problem.