On perfect colorings of the halved 24-cube

zbMATH Open1249.05122arXiv0803.0068MaRDI QIDQ3115705FDOQ3115705

Authors: Denis S. Krotov 

Publication date: 10 February 2012

Abstract: A vertex 2-coloring of a graph is said to be perfect with parameters $(a_{ij}{)}_{i,j=1}^k$ if for every $i,jin1,\mathrm{...},k$ every vertex of color $i$ is adjacent with exactly $a_{ij}$ vertices of color $j$. We consider the perfect 2-colorings of the distance-2 graph of the 24-cube ${0,1}^{24}$ with parameters $((20+c,256-c)(c,276-c))$ (i.e., with eigenvalue 20). We prove that such colorings exist for all $c$ from 1 to 128 except 1, 2, 4, 5, 7, 10, 13 and do not exist for $c=1,2,4,5,7$. Keywords: perfect coloring, equitable partition, hypercube, halved n-cube

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

Recommendations

• scientific article
• On perfect 2-colorings of the hypercube
• Perfect colorings of the 12-cube that attain the bound on correlation immunity
• Perfect 2-colorings of the cubic graphs of order less than or equal to 10
• On perfect 2-colorings of the \(q\)-ary \(n\)-cube

zbMATH Keywords

equitable partitionperfect coloringhalved \(n\)-cube

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (5)

• Title not available (Why is that?)
• On periodicity of perfect colorings of the infinite hexagonal and triangular grids
• Title not available (Why is that?)
• Title not available (Why is that?)
• On weight distributions of perfect colorings and completely regular codes

This page was built for publication: On perfect colorings of the halved 24-cube

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