• INDEPENDENT VERTEX-EDGE DOMINATION IN GRAPHS
Abstract
Let the vertices and edges of a graph be called the elements of . A set of elements in is an vertex-edge dominating set of if every element not in is either adjacent or incident to at least one element in . An vertex-edge dominating set of elements in is an independent vertex-edge dominating set of if any two elements in are neither adjacent nor incident. The independent vertex-edge domination number of , is the smallest cardinality of an independent vertex-edge dominating set of . In this paper, we obtained bounds for .
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 |