Extremal connectivity and vulnerability in graphs
暂无分享,去创建一个
If a practical network is modelled as a graph in which the lines are perfect but the points may fail then a primary measure of vulnerability is the point connectivity of the graph and one possible secondary measure of vulnerability is the number of minimum point disconnecting sets. The graph shold have the maximum possible point connectivity and the minimum number of point disconnecting sets. A lower bound for the number of minimum point disconnecting sets is derived by identifying points with identical adjacencies.
[1] Derek Smith,et al. Graphs with the smallest number of minimum cut sets , 1984, Networks.
[2] F. T. Boesch,et al. On the Invulnerability of the Regular Complete k-Partite Graphs , 1971 .
[3] S. Louis Hakimi,et al. On the design of reliable networks , 1973, Networks.