Connectivity and edge-bipancyclicity of Hamming shell

DOI10.1007/s12190-019-01269-8zbMath1428.05163arXiv1804.11094OpenAlexW2799167762WikidataQ127866630 ScholiaQ127866630MaRDI QIDQ2008085

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

connectivityhypercubesperfect codeedge-bipancyclicitydistant faulty verticesperfect independent domination

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of Cartesian products of graphs
• Edge-fault-tolerant edge-bipancyclicity of hypercubes
• On symmetric subgraphs of the 7-cube: An overview
• Equitable factorizations of Hamming shells
• Regular connected bipancyclic spanning subgraphs of hypercubes
• Independent perfect domination sets in Cayley graphs
• Dominating sets in n‐cubes
• Error Detecting and Error Correcting Codes
• The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification
• Leafy spanning trees in hypercubes

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