Multiply-twisted hypercube with five or more dimensions is not vertex-transitive

DOI10.1016/0020-0190(94)00167-WzbMATH Open1004.68596OpenAlexW1984099160MaRDI QIDQ674294FDOQ674294

Authors Saïd Bettayeb, Priyalal D. Kulasinghe

Publication date 28 February 1997

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

Full work available at URL https://doi.org/10.1016/0020-0190(94)00167-w

zbMATH Keywords

algorithmshypercubeinterconnection networkmultiply-twisted hypercube

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites work

• Embedding binary trees into crossed cubes

Cited in

(22)

• Independent spanning trees in crossed cubes
• Vertex-transitivity on folded crossed cubes
• A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes
• Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes
• Constructing completely independent spanning trees in crossed cubes
• Survey on path and cycle embedding in some networks
• The cycle-structure connectivity of crossed cubes
• Connectivity of the crossed cube
• Three completely independent spanning trees of crossed cubes with application to secure-protection routing
• A class of hierarchical graphs as topologies for interconnection networks
• Optimizing Hamiltonian panconnectedness for the crossed cube architecture
• Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube
• A comment on ``Independent spanning trees in crossed cubes
• (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn
• A two-stages tree-searching algorithm for finding three completely independent spanning trees
• Edge-independent spanning trees in folded crossed cubes
• Paths in Möbius cubes and crossed cubes
• Constructing the nearly shortest path in crossed cubes
• A note on path embedding in crossed cubes with faulty vertices
• Fault-tolerant embedding of paths in crossed cubes
• Transitivity of varietal hypercube networks
• Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes

This page was built for publication: Multiply-twisted hypercube with five or more dimensions is not vertex-transitive

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