|
![]() |
|||
|
||||
OverviewThis 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. Full Product DetailsAuthor: John T Saccoman (Seton Hall Univ, Usa) , Daniel J Gross (Seton Hall Univ, Usa) , Charles L Suffel (Stevens Inst Of Tech, Usa)Publisher: World Scientific Publishing Co Pte Ltd Imprint: World Scientific Publishing Co Pte Ltd Dimensions: Width: 15.50cm , Height: 1.80cm , Length: 23.10cm Weight: 0.476kg ISBN: 9789814566032ISBN 10: 9814566039 Pages: 188 Publication Date: 23 October 2014 Audience: College/higher education , Postgraduate, Research & Scholarly Format: Hardback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |