A Study of Odd Graphs as Fault-Tolerant Interconnection Networks
IEEE Transactions on Computers
Decomposing a star graph into disjoint cycles
Information Processing Letters
Arrangement graphs: a class of generalized star graphs
Information Processing Letters
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Pancycles and hamiltonian-connectedness of the hierarchical cubic network
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
Hamilton-connectivity and cycle-embedding of the Möbius cubes
Information Processing Letters
Pancyclicity of recursive circulant graphs
Information Processing Letters
Embedding Binary Trees into Crossed Cubes
IEEE Transactions on Computers
Embedding Hamiltonian Paths in Faulty Arrangement Graphs with the Backtracking Method
IEEE Transactions on Parallel and Distributed Systems
Node-ranking schemes for the star networks
Journal of Parallel and Distributed Computing
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Embedding k(n - k) edge-disjoint spanning trees in arrangement graphs
Journal of Parallel and Distributed Computing
Edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Processing Letters
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
Information Processing Letters
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
Edge-bipancyclicity of conditional faulty hypercubes
Information Processing Letters
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 hamiltonian paths in hypercubes with a required vertex in a fixed position
Information Processing Letters
Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
Computers & Mathematics with Applications
Embedding geodesic and balanced cycles into hypercubes
WSEAS Transactions on Mathematics
Edge-fault-tolerant edge-bipancyclicity of hypercubes
Information Processing Letters
Edge-fault-tolerant vertex-pancyclicity of augmented cubes
Information Processing Letters
Embedding meshes into twisted-cubes
Information Sciences: an International Journal
Conditional matching preclusion for the arrangement graphs
Theoretical Computer Science
Conditional fault tolerance of arrangement graphs
Information Processing Letters
Brief paper: Quantized consensus in Hamiltonian graphs
Automatica (Journal of IFAC)
Edge-bipancyclicity of all conditionally faulty hypercubes
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Geodesic pancyclicity of twisted cubes
Information Sciences: an International Journal
Fault diagnosability of arrangement graphs
Information Sciences: an International Journal
| Hi-index | 14.99 |
Arrangement graphs have been proposed as an attractive interconnection topology for large multiprocessor systems. The authors study these graphs by proving the existence of Hamiltonian cycles in any arrangement graph. They also prove that an arrangement graph contains cycles of all lengths ranging between 3 and the size of the graph. They show that an arrangement graph can be decomposed into node disjoint cycles in many different ways.