Abstract
TheR-domatic number of a graph is the maximum number of colors that can be used to color the vertices of the graph so that all vertices of the graph have at least one vertex of each color within distanceR.In this paper the problem of determining theR-domatic number of then-cube,P(n,R), is considered. The valueP(6,1) =5 is settled, and a conjecture by Laborde thatP(n, 1)≈n asntends to infinity is proved. Best known upper and lower bounds on theR-domatic number of then-cube are given forn≤16 andR≤7.
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.