Co r-Equality Domination in Graphs

Abstract

There are a lot of studies and scientific researches on domination and its different types. We introduce new types of domination. D is known as a co-r-equality dominating set because D ⊆ V(G), such that ∀ v ∈ V — B, where r vertices in D dominate the vertex v, The cardinality minimum of all MCrEDS is known as the co-r-equality dominance number, as shown by γcre(G). We determine best possible upper and lower bounds for Υcrs(G), discussed for several standard graphs such as: complete, complete bipartite, wheel graphs.