Disjoint independent dominating sets in graphs |
| |
Authors: | E.J. Cockayne S.T. Hedetniemi |
| |
Affiliation: | University of Victoria, Victoria, B.C., Canada;University of Virginia, Charlottesville, VA, U.S.A. |
| |
Abstract: | A set X of vertices of G is an independent dominating set if no two vertices of X are adjacent and each vertex not in X is adjacent to at least one vertex in X. Independent dominating sets of G are cliques of the complement of G and conversely.This work is concerned with the existence of disjoint independent dominating sets in a graph G. A new parameter, the maximum number of disjoint independent dominating sets in G, is studied and the class of graphs whose vertex sets partition into independent dominating sets is investigated. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|