• ON THE INDEPENDENT END EQUITABLE DOMINATION IN GRAPH
Abstract
An equitable dominating set in a graph is called independent equitable dominating set if the subgraph induced by is connected. In this paper we introduce the Independence end equitable domination in graphs. The values of this concept are found for some families of graphs relations with some other domination parameters are presented. Also we define the IED-graph. Necessary and sufficient conditions for any graph to be IED-graph are established.
Keywords
Full Text:
PDFThis 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 |