Outer complete fair domination in graphs

Graphs considered here are simple, finite and undirected. A graph is denoted by G and its vertex set by V (G) and edge set by E(G). Kulli and Janakiram introduced the concept of the strong non-spli...