On the Injective Equitable Domination of Graphs

HTML  XML Download Download as PDF (Size: 304KB)  PP. 2132-2139  
DOI: 10.4236/am.2016.717169    5,422 Downloads   6,526 Views  Citations

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.

Share and Cite:

Alkenani, A. , Alashwali, H. and Muthana, N. (2016) On the Injective Equitable Domination of Graphs. Applied Mathematics, 7, 2132-2139. doi: 10.4236/am.2016.717169.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.