J4 ›› 2010, Vol. 45 ›› Issue (3): 66-70.
• Articles • Previous Articles Next Articles
MA Bao-lin1,2, CHEN Xiang-en1*, LIU Juan2
Received:
Online:
Published:
Contact:
About author:
Supported by:
Supported by NNSFC (10771091)
Abstract:
Let G,H be simple graphs of order at least 2. The strong product of graph G and H is the graph G×H with vertex set V(G)×V(H), and (x1,x2)(y1,y2)∈E(G×H) whenever [x1y1∈E(G) and x2y2∈E(H)] or [x1=y1 and x2y2∈E(H)] or [x2=y2 and x1y1∈E(G)]. A 2distance coloring using k colors of a graph G is a mapping f from V(G) to {1,2,…,k} such that two distinct vertices lying at a distance less than or equal to 2 must be assigned different colors. The minimum number of colors required for a 2distance coloring of G is called the 2distance chromatic number of G, and denoted by χ2(G). We obtain lower and upper bounds of the 2distance chromatic number of strong product of graphs, which is Δ(G×H)+1≤χ2(G×H)≤χ2(G)·χ2(H), also shows that the bounds are tight. For some special families of graphs such as Pm×Pn, Pm×Kn, Pm×Wn, Pm×Sn, Pm×Fn, Pm×Cn(n≡0(mod 3)or =5),their 2-distance chromatic number are obtained.
Key words: graphs; strong product of graphs; 2-distance coloring; 2-distance chromatic number
MA Bao-lin1,2, CHEN Xiang-en1*, LIU Juan2. 2-distance coloring of strong product of graphs[J].J4, 2010, 45(3): 66-70.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://lxbwk.njournal.sdu.edu.cn/EN/
http://lxbwk.njournal.sdu.edu.cn/EN/Y2010/V45/I3/66
Cited