Abstract
For any graph = , , block graph is a graph whose set of vertices is the union of the set of blocks of in which two vertices are adjacent if and only if the corresponding blocks of are adjacent. A dominating set of a graph is a split block dominating set if the induced sub graph 〈 − 〉 is disconnected .The split block domination number of is the minimum cardinality of split block dominating set of . In this paper many bounds on are obtained in terms of elements of but not the elements of . Also its relation with other domination parameters is 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 callMore From: International Journal of Research in Engineering and Technology
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.
