Maximal independent sets in minimum colorings

被引：8

作者：

Arumugam, S. ^{[1
]}

Haynes, Teresa W. ^{[2
]}

Henning, Michael A. ^{[3
]}

Nigussie, Yared ^{[2
]}

机构：

[1] Kalasalingam Univ, N CARDMATH, CGRF, Anand Nagar 626190, Krishnankoil, India

[2] E Tennessee State Univ, Dept Math, Johnson City, TN 37614 USA

[3] Univ Johannesburg, Dept Math, ZA-2006 Auckland Pk, South Africa

来源：

DISCRETE MATHEMATICS | 2011年 / 311卷 / 13期

关键词：

Coloring; Chromatic number; Domination number; Maximal independent set; Dominating-chi-color number; Dom-color number;

D O I：

10.1016/j.disc.2010.06.045

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Every graph G contains a minimum vertex-coloring with the property that at least one color class of the coloring is a maximal independent set (equivalently, a dominating set) in G. Among all such minimum vertex-colorings of the vertices of G, a coloring with the maximum number of color classes that are dominating sets in G is called a dominating-chi-coloring of G. The number of color classes that are dominating sets in a dominating-chi-coloring of G is defined to be the dominating-chi-color number of G. In this paper, we continue to investigate the dominating-chi-color number of a graph first defined and studied in [1]. (C) 2010 Elsevier B.V. All rights reserved.

引用

页码：1158 / 1163

页数：6