Discrete Applied Mathematics
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Sciences: an International Journal
Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
The panpositionable panconnectedness of augmented cubes
Information Sciences: an International Journal
A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphs
Information Processing Letters
| Hi-index | 0.89 |
The alternating group graph was proposed as an interconnection network topology for computing systems. It has many advantages over n-cubes and star graphs. Let F be a set of faulty vertices in an n-dimensional alternating group graph AG"n. A cycle of length @? is said to be an @?-cycle. A previous result in [J.-M. Chang, J.-S. Yang, Fault-tolerant cycle-embedding in alternating group graphs, Appl. Math. Comput. 197 (2008) 760-767] showed that, for n=4, AG"n-F is pancyclic (i.e., AG"n-F contains an @?-cycle for each @? with 3==5. In this paper, for the same problem, we give an optimal result: for n=4, AG"n-F is pancyclic if |F|==4, AG"n-F is also hamiltonian if |F|=