The aim of this paper is to introduce a new definition of domination in graphs called observer domination. Let G=(V,E) be a connected undirected and simple graph having a domination numberγ, with D being a γ-set. A set O is called observer dominating set of G[D] if for each vertex in, having an adjacent vertex in O. The minimum number of cardinality of observer dominating set to each γ-set is called an observer domination number and denoted byγo(G). Some results of a path and variant operations of two paths for observer domination number are determined.
Volume 11 | 01-Special Issue
Pages: 486-495