TY - JOUR
T1 - A Survey of Component Order Connectivity Models of Graph Theoretic Networks
AU - Gross, Daniel
AU - Heinig, Monika
AU - Iswara, Lakshmi
AU - Kazmierczak, L. William
AU - Luttrell, Kristi
AU - Saccoman, John
AU - Suffel, Charles
PY - 2013/9
Y1 - 2013/9
N2 - The traditional vulnerability parameter connectivity is the minimum number of nodes needed to be removed to disconnect a network. Likewise, edge connectivity is the minimum number of edges needed to be removed to disconnect. A disconnected network may still be viable if it contains a sufficiently large component. Component order connectivity and component order edge connectivity are the minimum number of nodes, respectively edges needed to be removed so that all components of the resulting network have order less than some preassigned threshold value. In this paper we survey some results of the component order connectivity models.
AB - The traditional vulnerability parameter connectivity is the minimum number of nodes needed to be removed to disconnect a network. Likewise, edge connectivity is the minimum number of edges needed to be removed to disconnect. A disconnected network may still be viable if it contains a sufficiently large component. Component order connectivity and component order edge connectivity are the minimum number of nodes, respectively edges needed to be removed so that all components of the resulting network have order less than some preassigned threshold value. In this paper we survey some results of the component order connectivity models.
KW - Connectivity
KW - edge connectivity
KW - component order connectivity
KW - component order edge connectivity
KW - component order neighbor connectivity
UR - http://www.wseas.us/journal/pdf/mathematics/2013/265706-145.pdf
UR - https://www.researchgate.net/publication/286393717_A_survey_of_component_order_connectivity_models_of_graph_theoretic_networks
M3 - Article
VL - 12
SP - 895
EP - 910
JO - WSEAS Transactions on Mathematics
JF - WSEAS Transactions on Mathematics
IS - 9
ER -