Spanning Tree Results for Graphs and Multigraphs ─ A Matrix-Theoretic Approach
商品資訊
定價
:NT$ 2890 元優惠價
:90 折 2601 元
領券後再享91折起
領
團購優惠券A
8本以上且滿1500元
再享89折,單本省下286元
再享89折,單本省下286元
領
無庫存,下單後進貨(採購期約4~10個工作天)
可得紅利積點:78 點
相關商品
商品簡介
商品簡介
In this work, we consider the optimization problem of maximizing the number of spanning trees among graphs and multigraphs in the same class, i.e. having a fixed number of nodes and a fixed number of edges. 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.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.
主題書展
更多書展本週66折
您曾經瀏覽過的商品
購物須知
為了保護您的權益,「三民網路書店」提供會員七日商品鑑賞期(收到商品為起始日)。
若要辦理退貨,請在商品鑑賞期內寄回,且商品必須是全新狀態與完整包裝(商品、附件、發票、隨貨贈品等)否則恕不接受退貨。