We study perfect colorings of the Johnson graph in two colors. We give sufficient conditions for a perfect coloring of the Johnson graph to be k-regular and present examples of perfect colorings. The proof of the theorem is in many respects similar to the proof of the result by Etzion and Schwartz  on k-regularity of perfect codes.
Problems of Information Transmission – Springer Journals
Published: Feb 1, 2007
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud