Connectivity and edge-bipancyclicity of hamming shell

30 Apr 2018 Mane S. A. Waphare B. N.

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... (read more)

PDF Abstract
No code implementations yet. Submit your code now