On conditional coloring of some graphs

Details On conditional coloring of some graphs On conditional coloring of some graphs

2010-11-24

arxiv.org/abs/1011.5289v1

Computer Science

Discrete Mathematics

9 pages: accepted for the 76th annual conference of the Indian Mathematical Society,27-30 December 2010,Surat,India

Scientific paper

For integers r and k > 0(k>r),a conditional (k, r)-coloring of a graph G is a proper k-coloring of G such that every vertex v of G has at least min{r,d(v)} differently colored neighbors, where d(v) is the degree of v. In this note, for different values of r we obtain the conditional chromatic number of a grid $G(2,n) \cong P_2 \ \Box \ P_n$, $C_n^2$ and the strong product of $P_n$ and $P_m$ (n,m being positive integers). Also, for integers $n \geq 3$ and $t \geq 1$ the second order conditional chromatic number (also known as dynamic chromatic number) of the (t,n)-web graph is obtained.

Affiliated with

Also associated with

No associations

Rating

On conditional coloring of some 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 conditional coloring of some graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On conditional coloring of some graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-240378