Abstract
In this paper, we introduced the new concept detour global domination number for splitting graph of standard graph. The detour global dominating sets in some standard and special graphs are determined. First we recollect the concept of splitting graph of a graph and we produce some results based on the detour global domination number of splitting graph of star graph, bistar graph and complete bipartite graph. A set [Formula: see text] is called a detour global dominating set of [Formula: see text] if [Formula: see text] is both detour and global dominating set of [Formula: see text]. The detour global domination number is the minimum cardinality of a detour global dominating set in [Formula: see text].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.