Connectivity and edge-bipancyclicity of Hamming shell

DOI10.1007/S12190-019-01269-8MaRDI QIDQ2008085zbMATH OpenOpenAlexWikidataFDO

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

Publication date 22 November 2019

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1804.11094

zbMATH Keywords

connectivitydistant faulty verticesedge-bipancyclicityhypercubesperfect codeperfect independent domination

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Linear codes (general theory) (94B05)

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.

Recommendations

• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Regular connected bipancyclic spanning subgraphs of hypercubes
• Equitable factorizations of Hamming shells
• Two characterizations of generalized hypercube
• The pancyclicity and the Hamiltonian-connectivity of the generalized base-\(b\) hypercube

Cites work

• Connectivity of Cartesian products of graphs
• Dominating sets in n‐cubes
• Edge-fault-tolerant edge-bipancyclicity of hypercubes
• Equitable factorizations of Hamming shells
• Error detecting and error correcting codes
• scientific article; zbMATH DE number 1228780 (Why is no real title available?)
• scientific article; zbMATH DE number 871180 (Why is no real title available?)
• Independent perfect domination sets in Cayley graphs
• Leafy spanning trees in hypercubes
• Long cycles in hypercubes with distant faulty vertices
• On symmetric subgraphs of the 7-cube: An overview
• Regular connected bipancyclic spanning subgraphs of hypercubes
• The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification

Cited in

(1)

• Equitable factorizations of Hamming shells

This page was built for publication: Connectivity and edge-bipancyclicity of Hamming shell

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2008085)