SPANNING TREE RESULTS FOR GRAPHS AND MULTI...

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

90,90 €

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 1-2 Wochen

Kategorien:

Beschreibung

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)

Details

Erscheinungsjahr:	2014
Fachbereich:	Arithmetik & Algebra
Genre:	Importe , Mathematik
Rubrik:	Naturwissenschaften & Technik
Medium:	Buch
Inhalt:	Gebunden
ISBN-13:	9789814566032
ISBN-10:	9814566039
Sprache:	Englisch
Einband:	Gebunden
Autor:	John T Saccoman, Charles L Suffel & Dani
Hersteller:	World Scientific
Verantwortliche Person für die EU:	Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de
Maße:	235 x 157 x 15 mm
Von/Mit:	Charles L Suffel & Dani John T Saccoman
Erscheinungsdatum:	04.09.2014
Gewicht:	0,431 kg