Spanning Tree Results for Graphs and Multigraphs
Autor John T. Saccoman, Charles Suffel, Daniel J. Grossen Limba Engleză Hardback – 22 oct 2014
Preț: 501.44 lei
Preț vechi: 589.93 lei
-15% Nou
Puncte Express: 752
Preț estimativ în valută:
95.97€ • 99.93$ • 81.10£
95.97€ • 99.93$ • 81.10£
Carte tipărită la comandă
Livrare economică 10-24 martie
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
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.