b-coloring of Kneser graphs |
| |
Authors: | R Balakrishnan T Kavaskar |
| |
Institution: | 1. Department of Mathematics, Bharathidasan University, Tiruchirappalli-620024, India;2. Department of Mathematics, B. S. Abdur Rahman University, Chennai-600048, India |
| |
Abstract: | A -coloring of a graph with colors is a proper coloring of using colors in which each color class contains a color dominating vertex, that is, a vertex which has a neighbor in each of the other color classes. The largest positive integer for which has a -coloring using colors is the -chromatic number of . The -spectrum of a graph is the set of positive integers , for which has a -coloring using colors. A graph is -continuous if = the closed interval . In this paper, we obtain an upper bound for the -chromatic number of some families of Kneser graphs. In addition we establish that for the Kneser graph whenever . We also establish the -continuity of some families of regular graphs which include the family of odd graphs. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|