Abstract
Let G = (V;E) be a connected graph. A subset S of V (G) is called a boundary dominating set if every vertex of V S is boundary dominated by some vertex of S. The minimum taken over all boundary dominating sets of a graphG is called the boundary domination number ofG and is denoted by b(G). We define the boundary domatic number in graphs. Exact values of of Wheel Graph Families are obtained and some other interesting results are established.
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.
