Daniel Gross, Monika Heinig, Lakshmi Iswara, L. William Kazmierczak, Kristi Luttrell, John T. Saccoman, Charles Suffel, "A Survey of Component Order Connectivity Models of Graph Theoretic Networks," WSEAS Transactions on Mathematics, vol. 12, pp. -, 2013, DOI:
Daniel Gross, Monika Heinig, Lakshmi Iswara, L. William Kazmierczak, Kristi Luttrell, John T. Saccoman, Charles Suffel. A Survey of Component Order Connectivity Models of Graph Theoretic Networks.
WSEAS Transactions on Mathematics. 2013;12:-.
WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 12, 2013
A Survey of Component Order Connectivity Models of Graph Theoretic Networks
Authors: , , , , , ,
Abstract: 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.
Keywords:
Connectivity, edge connectivity, component order connectivity, component order edge connectivity, component order neighbor connectivity
Pages: - WSEAS Transactions on Mathematics, ISSN / E-ISSN: 1109-2769 / 2224-2880, Volume 12, 2013DOI: *As the DOI is a unique identifier, it is already available in the pdf version.
**The DOI link will be activated in the first midst of January 2026.
, Art. #
×
Citation Tools