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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
