Computation of Odd Geo-Domination Number of a Graph

Abstract

A geodominating set S ⊆ V of a graph G is said to be an odd geo-dominating set if for every vertex , , and The minimum cardinality of the odd geo-dominating set is called odd geo-domination number denoted by . The odd geo-dominating set with cardinality is called – set of G. We develop an algorithm to compute an odd geo-domination number of graphs and for some families of graphs.