Topological Properties of Hypercubes
IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
On the existence of Hamiltonian circuits in faulty hypercubes
SIAM Journal on Discrete Mathematics
Arrangement graphs: a class of generalized star graphs
Information Processing Letters
Fault-Tolerant Ring Embedding in de Bruijn Networks
IEEE Transactions on Computers
Information Processing Letters
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Longest Fault-Free Paths in Star Graphs with Edge Faults
IEEE Transactions on Computers
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
Embedding Hamiltonian Paths in Faulty Arrangement Graphs with the Backtracking Method
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Graph Theory With Applications
Graph Theory With Applications
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed Computing
Highly fault-tolerant cycle embeddings of hypercubes
Journal of Systems Architecture: the EUROMICRO Journal
Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
Journal of Parallel and Distributed Computing
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
IEEE Transactions on Parallel and Distributed Systems
Edge-pancyclicity and path-embeddability of bijective connection graphs
Information Sciences: an International Journal
Hamiltonian connectivity of the WK-recursive network with faulty nodes
Information Sciences: an International Journal
Geodesic pancyclicity of crossed cubes
MATH'06 Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS
Embedding of meshes in Möbius cubes
Theoretical Computer Science
Embedding a family of meshes into twisted cubes
Information Processing Letters
International Journal of Computer Mathematics
Embedding a family of 2D meshes into Möbius cubes
WSEAS Transactions on Mathematics
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Information Sciences: an International Journal
Fault-free longest paths in star networks with conditional link faults
Theoretical Computer Science
Path embeddings in faulty 3-ary n-cubes
Information Sciences: an International Journal
Bipanconnectivity of balanced hypercubes
Computers & Mathematics with Applications
Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
Information Sciences: an International Journal
Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
Discrete Applied Mathematics
Conditional matching preclusion for the arrangement graphs
Theoretical Computer Science
Conditional fault tolerance of arrangement graphs
Information Processing Letters
Edge-pancyclicity of twisted cubes
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
Hamiltonian connectivity of 2-tree-generated networks
Mathematical and Computer Modelling: An International Journal
Matching preclusion and conditional matching preclusion for regular interconnection networks
Discrete Applied Mathematics
The paths embedding of the arrangement graphs with prescribed vertices in given position
Journal of Combinatorial Optimization
Fault diagnosability of arrangement graphs
Information Sciences: an International Journal
| Hi-index | 14.98 |
Abstract--The arrangement graph An,k is a generalization of the star graph. There are some results concerning fault Hamiltonicity and fault Hamiltonian connectivity of the arrangement graph. However, these results are restricted in some particular cases and, thus, are less completed. In this paper, we improve these results and obtain a stronger and simpler statement. Let n-k \ge 2 and F \subseteq V(An,k) \cup E(An,k). We prove that An,k - F is Hamiltonian if |F| \le k(n-k) -2 and An,k - F is Hamiltonian connected if |F| \le k(n-k) -3. These results are optimal.