Embedding of cycles in arrangement graphs

DOI10.1109/12.238494zbMath1395.05090OpenAlexW2129911565MaRDI QIDQ5375325

Anand Tripathi, Khaled Day

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.238494

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (36)

Hamiltonian cycle embedding for fault tolerance in balanced hypercubes ⋮ Determining the Hamilton-connectedness of certain vertex-transitive graphs ⋮ Embedding cycles in IEH graphs ⋮ Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs ⋮ Edge-bipancyclicity of conditional faulty hypercubes ⋮ Adaptive Diagnosis of Hamiltonian Networks under the Comparison Model ⋮ Structure fault-tolerance of arrangement graphs ⋮ Conditional diagnosability of arrangement graphs under the PMC model ⋮ Panpositionable hamiltonicity and panconnectivity of the arrangement graphs ⋮ Conditional fault tolerance of arrangement graphs ⋮ Geodesic pancyclicity of twisted cubes ⋮ Bipanconnectivity of faulty hypercubes with minimum degree ⋮ Quantized consensus in Hamiltonian graphs ⋮ Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees ⋮ Conditional matching preclusion for the arrangement graphs ⋮ Edge-fault-tolerant vertex-pancyclicity of augmented cubes ⋮ Embedding of meshes in Möbius cubes ⋮ Fault diagnosability of arrangement graphs ⋮ The Super Spanning Connectivity of Arrangement Graphs ⋮ Edge-fault-tolerant pancyclicity of arrangement graphs ⋮ Vertex-fault-tolerant cycles embedding in balanced hypercubes ⋮ Fault-tolerant cycle-embedding in alternating group graphs ⋮ Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position ⋮ Bipancyclic properties of Cayley graphs generated by transpositions ⋮ Embedding meshes into twisted-cubes ⋮ Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position ⋮ Vertex-pancyclicity of augmented cubes with maximal faulty edges ⋮ Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes ⋮ Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes ⋮ Unnamed Item ⋮ Note on reliability evaluation of arrangement graphs ⋮ Edge-fault-tolerant edge-bipancyclicity of hypercubes ⋮ On the arrangement graph. ⋮ Pancyclicity of recursive circulant graphs ⋮ Hamilton-connectivity and cycle-embedding of the Möbius cubes ⋮ An optimal embedding of cycles into incomplete hypercubes

This page was built for publication: Embedding of cycles in arrangement graphs