\(\Phi\)-Strong(weak) Domination in a Graph

Abstract

Let \(G = (V, E)\) be a graph. Let \(\Phi: V \to {R}\), where \({R}\) is the set of all reals (\({R}\) can be replaced by any chain). We say that \(u\) \(\Phi\)-strongly dominates \(v\) and \(v\) \(\Phi\)-weakly dominates \(u\) if \(uv \in E\) and \(\Phi(u) \geq \Phi(v)\). When \(\Phi\) is a constant function, we have the usual domination and when \(\Phi\) is the degree function of the graph, we have the strong (weak) domination studied by Sampathkumar et al. In this paper, we extend the results of O. Ore regarding minimal dominating sets of a graph. We also extend the concept of fully domination balance introduced by Sampathkumar et al and obtain a lower bound for strong domination number of a graph.