Fault-tolerant Hamiltonian connectedness of cycle composition networks (Q2474880): Difference between revisions

Let \(G\) be a \(k\)-regular hamiltonian connected graph. Then \(G\) is called ``super fault-tolerant hamiltonian'' if it remains Hamiltonian when at most \(k-2\) vertices and/or edges are removed, and remains Hamiltonian connected whenever at most \(k-3\) vertices and/or edges are removed. When \(k \geq 5\), a cycle composition framework introduced in [\textit{Y.-C. Chen, C.-H. Tsai, L.-H. Tsu, J. J. M. Tan}, Appl. Math. Comput. 177, 465-481 (2006; Zbl 1094.05035)] constructs a \((k+2)\)-super fault-tolerant Hamiltonian graph from \(k\)-super fault-tolerant Hamiltonian graphs. In this paper the technique is extended to handle the case when \(k=4\).