Daniel J Gross,
John T Saccoman,
Charles L Suffel
SPANNING TREE RESULTS FOR GRAPHS AND MULTIGRAPHS: A MATRIX-THEORETIC APPROACH
Gebonden EN 2014 9789814566032Levertijd ± 16 werkdagen
Gratis verzonden
Samenvatting
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)
Specificaties
ISBN13:9789814566032
Taal:EN
Bindwijze:Gebonden
Aantal pagina's:188
Uitgever:World Scientific Publishing Co Pte Ltd
Lezersrecensies
Wees de eerste die een lezersrecensie schrijft!
Rubrieken
- advisering
- algemeen management
- coaching en trainen
- communicatie en media
- economie
- financieel management
- inkoop en logistiek
- internet en social media
- it-management / ict
- juridisch
- leiderschap
- marketing
- mens en maatschappij
- non-profit
- ondernemen
- organisatiekunde
- personal finance
- personeelsmanagement
- persoonlijke effectiviteit
- projectmanagement
- psychologie
- reclame en verkoop
- strategisch management
- verandermanagement
- werk en loopbaan