Can I read Connectivity and Edge-bipancyclicity of Hamming Shell on EtoBox?

Connectivity and Edge-bipancyclicity of Hamming Shell by Mane, S. A.; Waphare, B. N. is a scholarly article available to read on EtoBox.

What is Connectivity and Edge-bipancyclicity of Hamming Shell about?

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.

Author

Mane, S. A.; Waphare, B. N.

Published

2018

Language

EN