Optimizing Hamiltonian panconnectedness for the crossed cube architecture

DOI10.1016/J.AMC.2018.03.002MaRDI QIDQ2333183zbMATH OpenOpenAlexWikidataFDO

Authors Tzu-Liang Kung, Hon-Chan Chen

Publication date 12 November 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2018.03.002

zbMATH Keywords

crossed cubeHamiltonianinterconnection networkpanconnectednesspath embedding

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• On the path-connectivity, vertex-pancyclicity, and edge-pancyclicity of crossed cubes
• Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions
• Constructing the nearly shortest path in crossed cubes
• The panpositionable panconnectedness of augmented cubes
• Improving the panconnectedness property of locally twisted cubes

Cites work

• A note on path embedding in crossed cubes with faulty vertices
• Augmented cubes
• Complete path embeddings in crossed cubes
• Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions
• Embedding binary trees into crossed cubes
• Fault-tolerant cycle-embedding of crossed cubes
• Graph theory
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 3550742 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• Improving the panconnectedness property of locally twisted cubes
• Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
• On the bipanpositionable bipanconnectedness of hypercubes
• The locally twisted cubes
• The panpositionable panconnectedness of augmented cubes
• The two-equal-disjoint path cover problem of matching composition network
• Topological properties of the crossed cube architecture

Cited in

(6)

• Structure connectivity and substructure connectivity of the crossed cube
• Constructing the nearly shortest path in crossed cubes
• On the path-connectivity, vertex-pancyclicity, and edge-pancyclicity of crossed cubes
• Panpositionable hamiltonicity of the alternating group graphs
• Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions
• Embedding crossed cube into diverse product graphs and tree-derived architectures

This page was built for publication: Optimizing Hamiltonian panconnectedness for the crossed cube architecture

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