Locally twisted cubes are 4-pancyclic.
From MaRDI portal
Publication:1767147
DOI10.1016/j.aml.2003.10.009zbMath1056.05074OpenAlexW1965129454MaRDI QIDQ1767147
David J. Evans, Graham M. Megson, Xiaofan Yang
Publication date: 7 March 2005
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2003.10.009
Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (38)
Construction independent spanning trees on locally twisted cubes in parallel ⋮ Locally exchanged twisted cubes: connectivity and super connectivity ⋮ Panconnectivity of locally twisted cubes ⋮ Node-pancyclicity and edge-pancyclicity of hypercube variants ⋮ Fault-tolerant pancyclicity of augmented cubes ⋮ The \(g\)-good-neighbor conditional diagnosability of locally twisted cubes ⋮ Embedding mutually edge-disjoint cycles into locally twisted cubes ⋮ Improving the panconnectedness property of locally twisted cubes ⋮ DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph ⋮ The generalized 4-connectivity of locally twisted cubes ⋮ Optimal broadcasting for locally twisted cubes ⋮ \( R_3\)-connectivity of folded hypercubes ⋮ Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans ⋮ Embedding Wheel - like Networks ⋮ The spined cube: a new hypercube variant with smaller diameter ⋮ \(\{2,3\}\)-restricted connectivity of locally twisted cubes ⋮ Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes ⋮ Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model ⋮ Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity ⋮ Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance ⋮ A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes ⋮ \(h\)-restricted connectivity of locally twisted cubes ⋮ Fault-tolerant cycle-embedding in alternating group graphs ⋮ A novel algorithm to embed a multi-dimensional torus into a locally twisted cube ⋮ Linear layout of locally twisted cubes ⋮ Fault-tolerant edge-pancyclicity of locally twisted cubes ⋮ Efficient unicast in bijective connection networks with the restricted faulty node set ⋮ An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges ⋮ Embedding meshes into locally twisted cubes ⋮ Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks ⋮ Survey on path and cycle embedding in some networks ⋮ Star graph automorphisms and disjoint Hamilton cycles ⋮ Changing the diameter of the locally twisted cube ⋮ Fault tolerance of locally twisted cubes ⋮ Communication Performance Evaluation of the Locally Twisted Cube ⋮ Generalized matching networks and their properties
Cites Work
This page was built for publication: Locally twisted cubes are 4-pancyclic.
