LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Perfect 2‐colorings of Hamming graphs

Photo from wikipedia

We 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… Click to show full abstract

We 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 $H(n,q)$ for small $n$ and $q$.

Keywords: hamming graphs; colorings hamming; perfect colorings

Journal Title: Journal of Combinatorial Designs
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.