MATHEMATICA BOHEMICA, Vol. 134, No. 1, pp. 77-86, 2009

Nearly antipodal chromatic number $ac'(P_n)$
of the path $P_n$

Srinivasa Rao Kola, Pratima Panigrahi

Srinivasa Rao Kola, Pratima Panigrahi, Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, India, e-mail: srinivas@maths.
iitkgp.ernet.in
, pratima@maths.iitkgp.ernet.in

Abstract: Chartrand et al. (2004) have given an upper bound for the nearly antipodal chromatic number $ac'(P_n)$ as $\binom{n-2}2+2$ for $n \geq9$ and have found the exact value of $ac'(P_n)$ for $n=5,6,7,8$. Here we determine the exact values of $ac'(P_n)$ for $n \geq8$. They are $2p^2-6p+8$ for $n=2p$ and $2p^2-4p+6$ for $n=2p+1$. The exact value of the radio antipodal number $ac(P_n)$ for the path $P_n$ of order $n$ has been determined by Khennoufa and Togni in 2005 as $2p^2-2p+3$ for $n=2p+1$ and $2p^2-4p+5$ for $n=2p$. Although the value of $ac(P_n)$ determined there is correct, we found a mistake in the proof of the lower bound when $n=2p$ (Theorem $6$). However, we give an easy observation which proves this lower bound.

Keywords: radio $k$-coloring, span, radio $k$-chromatic number

Classification (MSC 2000): 05C78, 05C12, 05C15


Full text available as PDF (smallest), as compressed PostScript (.ps.gz) or as raw PostScript (.ps).

Access to the full text of journal articles on this site is restricted to the subscribers of Myris Trade. To activate your access, please contact Myris Trade at myris@myris.cz.


[Previous Article] [Next Article] [Contents of This Number] [Contents of Mathematica Bohemica]
[Full text of the older issues of Mathematica Bohemica at DML-CZ]