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.
€33.99
यह ईबुक खरीदें और 1 और मुफ़्त पाएं!
भाषा अंग्रेज़ी ● स्वरूप EPUB ● पेज 188 ● ISBN 9789814566056 ● फाइल का आकार 3.8 MB ● प्रकाशक World Scientific Publishing Company ● शहर Singapore ● देश SG ● प्रकाशित 2014 ● डाउनलोड करने योग्य 24 महीने ● मुद्रा EUR ● आईडी 5528120 ● कॉपी सुरक्षा Adobe DRM
एक DRM सक्षम ईबुक रीडर की आवश्यकता है
एक ही लेखक से अधिक ईबुक / संपादक
48,763 इस श्रेणी में ईबुक
