论文信息 - A Survey of Component Order Connectivity Models of Graph Theoretic Networks

A Survey of Component Order Connectivity Models of Graph Theoretic Networks

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. Key–Words: Connectivity, edge connectivity, component order connectivity, component order edge connectivity, component order neighbor connectivity

John T. Saccoman | C. Suffel | Kristi Luttrell

[1] F. Harary. THE MAXIMUM CONNECTIVITY OF A GRAPH. , 1962, Proceedings of the National Academy of Sciences of the United States of America.

[2] Paul Erdös,et al. On a theorem of Rademacher-Turán , 1962 .

[3] G. Gunther,et al. Neighbour-connectivity in regular graphs , 1985, Discret. Appl. Math..

[4] Richard J. Nowakowski,et al. Neighbor-connected graphs and projective planes , 1987, Networks.

[5] Saumyendra Sengupta,et al. Graphs and Digraphs , 1994 .

[6] C. Suffel,et al. On the relationship between connectivity and component order connectivity , 2003 .

[7] Daniel Gross,et al. Realizability Results Involving Two Connectivity Parameters , 2007, Ars Comb..

[8] Daniel Gross,et al. A generalization of an edge-connectivity theorem of Chartrand , 2009, Networks.

[9] Daniel Gross,et al. On Component Order Edge Connectivity Of a Complete Bipartite Graph , 2013, Ars Comb..