Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
From MaRDI portal
Publication:674294
DOI10.1016/0020-0190(94)00167-WzbMath1004.68596OpenAlexW1984099160MaRDI QIDQ674294
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
Related Items (22)
Connectivity of the crossed cube ⋮ Vertex-transitivity on folded crossed cubes ⋮ Constructing the nearly shortest path in crossed cubes ⋮ The cycle-structure connectivity of crossed cubes ⋮ A comment on ``Independent spanning trees in crossed cubes ⋮ Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube ⋮ Edge-independent spanning trees in folded crossed cubes ⋮ (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn ⋮ Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes ⋮ Constructing completely independent spanning trees 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 ⋮ A class of hierarchical graphs as topologies for interconnection networks ⋮ 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 ⋮ Three completely independent spanning trees of crossed cubes with application to secure-protection routing ⋮ A two-stages tree-searching algorithm for finding three completely independent spanning trees ⋮ Survey on path and cycle embedding in some networks ⋮ Paths in Möbius cubes and crossed cubes ⋮ Optimizing Hamiltonian panconnectedness for the crossed cube architecture ⋮ Independent spanning trees in crossed cubes
Cites Work
This page was built for publication: Multiply-twisted hypercube with five or more dimensions is not vertex-transitive