TITLE:
On the Injective Equitable Domination of Graphs
AUTHORS:
Ahmad N. Alkenani, Hanaa Alashwali, Najat Muthana
KEYWORDS:
Domination, Injective Equitable Domination, Injective Equitable Domination Number
JOURNAL NAME:
Applied Mathematics,
Vol.7 No.17,
November
17,
2016
ABSTRACT: A dominating set D in a graph G is called
an injective equitable dominating set (Inj-equitable dominating set) if for
every , there exists such that u is adjacent to v and . The minimum cardinality
of such a dominating set is denoted by and is called the Inj-equitable
domination number of G. In this paper, we introduce the injective equitable
domination of a graph and study its relation with other domination parameters.
The minimal injective equitable dominating set, the injective equitable
independence number , and the injective equitable domatic number are defined.