Spanning Tree Results for Graphs and Multigraphs: a Matrix-theoretic Approach - Gross, Daniel J (Seton Hall University, USA) - Grāmatas - World Scientific Publishing Co Pte Ltd - 9789814566032 - 2014. gada 23. oktobris
Ja vāks un nosaukums nesakrīt, pareizs ir nosaukums

Gross, Daniel J (Seton Hall University, USA)
Spanning Tree Results for Graphs and Multigraphs: a Matrix-theoretic Approach

Cena
€ 87,49

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 11. - 21. sept.
Saņemiet paziņojumus par jauniem Gross, Daniel J (Seton Hall University, USA) izdevumiem

Mūsu klienti saka:

14 dienu atgriešanas politika saskaņā ar Eiropas patērētāju tiesību aizsardzības likumu
Top vieta Trustpilot
Pievienot savam iMusic vēlmju sarakstam

Not rated yet

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.

Readership: Graduate students and researchers in combinatorics and graph theory.

200 pages

Mediji Grāmatas     Hardcover Book   (Grāmata ar cieto muguriņu un vāku)
Izlaists 2014. gada 23. oktobris
ISBN13 9789814566032
Izdevēji World Scientific Publishing Co Pte Ltd
Lapas 188
Izmēri 162 × 238 × 18 mm   ·   482 g
Valoda Angļu  

Vairāk no tā paša izdevēja

Skatīt visus Gross, Daniel J (Seton Hall University, USA) ( piem., Hardcover Book )