• 2 - EQUITABLE DOMINATION IN GRAPHS

Sivakumar. S., N. D. Soner, Anwar Alwardi*

Abstract


Let be a graph. A subset of is called an equitable dominating set of a graph if for every , there exists a vertex such that and . An equitable dominating set is said to be a connected equitable dominating set if the subgraph induced by is connected. In this paper we introduce the 2- equitable domination and 2-connected equitable domination in a graph, bounds and exact values for some standard graphs are found.

Keywords


equitable domination number, 2-equitable dominating set, 2-connected equitable dominating.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility		Web Counter