Title of article :
Coloring the square of the Kneser graph image and the Schrijver graph image Original Research Article
Author/Authors :
Jun-Yo Chen، نويسنده , , Ko-Wei Lih، نويسنده , , Jiaojiao Wu، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2009
Abstract :
The Kneser graph image is the graph whose vertex set consists of all image-subsets of an image-set, and two vertices are adjacent if and only if they are disjoint. The Schrijver graph image is the subgraph of image induced by all vertices that are 2-stable subsets. The square image of a graph image is defined on the vertex set of image such that distinct vertices within distance two in image are joined by an edge. The span image of image is the smallest integer image such that an image-labeling of image can be constructed using labels belonging to the set image. The following results are established. (1) image for image and image; (2) image for image, image, image, image, and image.
Keywords :
L(2 , 1)-labeling , Graph square , 1)L(2 , Kneser graph , Schrijver graph , Chromatic number
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics