Fault-tolerant cycle-embedding in alternating group graphs (Q2479251): Difference between revisions

In this paper the fault-tolerant hamiltonicity of alternating group graphs is studied. Such graphs where proposed as interconnection topologies for parallel and distributed systems. Let \(F\) be a set of faulty elements in a graph \(G\) and \(G- F\) denote the residual graph of \(G\) by removing the faulty elements. For the \(n\)-dimensional alternating group graph \(AG_n\) with \(n\geq 4\) and \(F\subset V(AG_n)\) it is known that \(AG_n- F\) is Hamiltonian if \(|F|\leq n- 2\) and is Hamiltonian connected if \(|F|\leq n- 3\). In this paper, an improvement of this result is proved and a new characterization of fault-tolerant pancyclicity on \(AG_n\) is given. For \(n\geq 4\) and \(F\subset V(AG_n)\), the following properties hold: {\parindent=8mm \begin{itemize}\item[(i)]\(AG_n- F\) is pancyclic if \(F\leq n- 2\); \item[(ii)]\(AG_n- F\) is vertex-pancyclic if \(|F|\leq n- 3\); and \item[(iii)]\(AG_n- F\) is edge 4-pancyclic if \(|F|\leq n- 4\). \end{itemize}}