Store besparelser
Hurtig levering
Fri fragt over 499,-
Gemte
Log ind
0
Kurv
Kurv
Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach
Engelsk Hardback
Se mere i:

Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach

Engelsk Hardback

799 kr
Tilføj til kurv
Sikker betaling
23 - 25 hverdage

Om denne bog

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)

Product detaljer
Sprog:
Engelsk
Sider:
188
ISBN-13:
9789814566032
Indbinding:
Hardback
Udgave:
ISBN-10:
9814566039
Udg. Dato:
23 okt 2014
Længde:
18mm
Bredde:
162mm
Højde:
238mm
Forlag:
World Scientific Publishing Co Pte Ltd
Oplagsdato:
23 okt 2014
Finder produkter...
Kategori sammenhænge