Connectivity and edge-bipancyclicity of hamming shell
Combinatorics
2018-05-01 v1
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.
Keywords
Cite
@article{arxiv.1804.11094,
title = {Connectivity and edge-bipancyclicity of hamming shell},
author = {S. A. Mane and B. N. Waphare},
journal= {arXiv preprint arXiv:1804.11094},
year = {2018}
}
Comments
Total 11 pages with 5 figures