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
购买此电子书可免费获赠一本！
语言 英语 ● 格式 EPUB ● 网页 188 ● ISBN 9789814566056 ● 文件大小 3.8 MB ● 出版者 World Scientific Publishing Company ● 市 Singapore ● 国家 SG ● 发布时间 2014 ● 下载 24 个月 ● 货币 EUR ● ID 5528120 ● 复制保护 Adobe DRM
需要具备DRM功能的电子书阅读器
来自同一作者的更多电子书 / 编辑
48,763 此类电子书
