On the locating chromatic number of Kneser graphs

Details On the locating chromatic number of Kneser graphs On the locating chromatic number of Kneser graphs

2011-04-15

arxiv.org/abs/1104.3097v2

Mathematics

Combinatorics

To appear in D.A.M

Scientific paper

Let $c$ be a proper $k$-coloring of a connected graph $G$ and $\Pi=(C_1,C_2,...,C_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $\Pi$ is defined to be the ordered $k$-tuple $$c_{{}_\Pi}(v):=(d(v,C_1),d(v,C_2),...,d(v,C_k)),$$ where $d(v,C_i)=\min\{d(v,x) |x\in C_i\}, 1\leq i\leq k$. If distinct vertices have distinct color codes, then $c$ is called a locating coloring. The minimum number of colors needed in a locating coloring of $G$ is the locating chromatic number of $G$, denoted by $\Cchi_{{}_L}(G)$. In this paper, we study the locating chromatic number of Kneser graphs. First, among some other results we show that $\Cchi_{{}_L}(KG(n,2))=n-1$ for all $n\geq 5$. Then, we prove that $\Cchi_{{}_L}(KG(n,k))\leq n-1$, when $n\geq k^2$. Moreover, we present some bounds for the locating chromatic number of odd graphs.

Affiliated with

Also associated with

No associations

Rating

On the locating chromatic number of Kneser graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the locating chromatic number of Kneser graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the locating chromatic number of Kneser graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-9155