  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.
