Networks · 1989 · 11 citations · 4 references
EngineeringNetwork RobustnessNetwork AnalysisPractical NetworkReliability EngineeringRandom GraphData ScienceExtremal ConnectivityMinimum PointSocial Network AnalysisReliabilityLower BoundComputer ScienceAttack GraphNetwork TheoryNetwork ScienceGraph TheorySurvivable NetworkBusinessExtremal Graph Theory
Abstract 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.
4
On the design of reliable networks
S. L. Hakimi, Ashok T. Amin · Networks · 1973 · 29 citations
Network Theory (Electrical Engineering), Engineering, Reliable Networks +20
Graphs with the smallest number of minimum cut sets
Derek H. Smith · Networks · 1984 · 21 citations