Connectivity and edge-bipancyclicity of hamming shell
classification
🧮 math.CO
keywords
hammingshellconnectedcalledcodeconnectivitydeletingdistance
read the original abstract
An Any graph obtained by deleting a Hamming code of length n from a n-cube Qn is called as a Hamming shell. It is well known that a Hamming shell is vertex-transitive, edge-transitive, distance preserving. Moreover, it is Hamiltonian and connected. In this paper, we prove that a Hamming shell is edge-bipancyclic and (n-1)-connected.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.