Paths in Möbius cubes and crossed cubes

DOI10.1016/J.IPL.2005.09.015zbMATH Open1177.05062OpenAlexW2126875464MaRDI QIDQ1045907FDOQ1045907

Authors: Jun-Ming Xu, Meijie Ma, Min Lu 

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.09.015

Recommendations

• Edge-pancyclicity of Möbius cubes
• Complete path embeddings in crossed cubes
• Fault-tolerant embedding of paths in crossed cubes
• Constructing the nearly shortest path in crossed cubes
• On the path-connectivity, vertex-pancyclicity, and edge-pancyclicity of crossed cubes

zbMATH Keywords

hypercubespathHamilton-connectedcrossed cubesMöbius cubes

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40)

Cites Work

• Fault-tolerant cycle-embedding of crossed cubes
• Hamilton-connectivity and cycle-embedding of the Möbius cubes
• The Mobius cubes
• Connectivity of the crossed cube
• Embedding binary trees into crossed cubes
• Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
• Topological properties of twisted cube
• Node-pancyclicity and edge-pancyclicity of crossed cubes
• Title not available (Why is that?)
• Asymptotics of the average number of nondominant options of binary relations

Cited In (20)

• (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn
• Two node-disjoint paths in balanced hypercubes
• How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?
• Survey on path and cycle embedding in some networks
• Bipanconnectivity of balanced hypercubes
• Cubes and Boxes Have Rupert’s Passages in Every Nontrivial Direction
• Cycle embedding in star graphs with conditional edge faults
• Path embedding in star graphs
• Crossings, Motzkin paths and moments
• Fault-tolerant embedding of paths in crossed cubes
• Embedding a family of disjoint multi-dimensional meshes into a crossed cube
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes
• Matching preclusion and conditional matching preclusion for crossed cubes
• Embedding a family of disjoint 3D meshes into a crossed cube
• Embedding meshes/tori in faulty crossed cubes
• Title not available (Why is that?)
• A note on path embedding in crossed cubes with faulty vertices
• Embedding a long fault-free cycle in a crossed cube with more faulty nodes
• Constructing the nearly shortest path in crossed cubes

This page was built for publication: Paths in Möbius cubes and crossed cubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045907)