h-Extra connectivity of alternating group graph AG_n
Lin Li-me · 2013
Let G =(V,E) be a graph with a subset F(?) V(G).F is called a h-extra vertexseparting set of G if G-F is disconnected and each connected component of G-F has at least h+1 vertices.The h-extra vertex-connectivity of G,denoted by k_o~((h))(G),is the cardinality of the minimum hextra vertex-separting set of G,which can reflect the fault tolerance of the graph efficiently.Through the characterization of fault tolerance of alternating group graph AG_n,this paper establishes that k_o~((1))(AG_n)=4n-11,k_o~((2))(AG_n)=6n-19,k_o~((3))(AG_n)=8n-28,respectively.