Abstract

In this paper, a new concept of domination which is called whole even sum domination is presented, many bounded, properties, remarks, examples, are introduced. Furthermore, some operations as join and corona graphs of sum graphs are discussed. Finally, determined this number of the graph obtained from a graph G by the removal of all edges between any pair of neighbours of a vertex.

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 call

Disclaimer: 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.