Premium
Extremal connectivity and vulnerability in graphs
Author(s) -
Doty Lynne L.
Publication year - 1989
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230190106
Subject(s) - measure (data warehouse) , vulnerability (computing) , graph , mathematics , point (geometry) , combinatorics , upper and lower bounds , cut point , computer science , discrete mathematics , data mining , statistics , mathematical analysis , geometry , computer security
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.