Structure and substructure connectivity of alternating group graphs

On complexity of structure and substructure connectivity, component connectivity and restricted connectivity of graphs

“…Structure and substructure connectivity of some famous interconnection networks have been determined, such as hypercube [9], k-ary n-cube [11], folded hypercube [12], balanced hypercube [10], arrangement graph [7], alternating group graphs [8]. A natural question arise: what is computational complexity of structure and substructure connectivity in general graphs?…”