Abstract
For a path Pn of order n, Chartrand et al. [3] have given an upper bound for radio k-chromatic number when 1 ≤ k ≤ n — 1. Liu and Zhu [7] have determined the exact value of radio (n — 1)-chromatic number of Pn, namely radio number, rn(Pn), when n ≥ 3. Khennoufa and Togni [5] have given the exact value of radio (n — 2)-chromatic number of Pn, namely antipodal number, ac(Pn), when n ≥ 5. Kola and Panigrahi [6] have given the exact value of radio (n — 3)-chromatic number of Pn, namely nearly antipodal number, ac'(Pn), when n ≥ 8. In this paper, we give the exact value of radio (n — 4)-chromatic number of Pn, rcn-4(Pn), when n is odd and n ≥ 11. Consequently, the lower bound of rcn-4(Pn+i), n ≥ 11 and i ≥ 1 is improved. We also improve the upper bound of rcn-4(Pn) when n is even and n ≥ 12.
Sign-in/Register to access full text options 
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 callMore From: AKCE International Journal of Graphs and Combinatorics
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.
