Abstract
AbstractWe consider the problem of existence of perfect 2‐colorings (equitable 2‐partitions) of Hamming graphs with given parameters. We start with conditions on parameters of graphs and colorings that are necessary for their existence. Next we observe known constructions of perfect colorings and propose some new ones giving new parameters. At last, we deduce which parameters of colorings are covered by these constructions and give tables of admissible parameters of 2‐colorings in Hamming graphs for small and . Using the connection with perfect colorings, we construct an orthogonal array OA(2048, 7, 4, 5).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
