Abstract
The achromatic number α of a graph is the largest number of colors that can be assigned to its vertices such that adjacent vertices have different color and every pair of different colors appears on the end vertices of some edge.We estimate the achromatic number of Kneser graphs K(n,k) and determine α(K(n,k)) for some values of n and k. Furthermore, we study the achromatic number of some geometric type Kneser graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.