
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Download to read offline
Download to read offline
A dominating set is a split dominating
set in . If the induced subgraph is
disconnected in The split domination number of
is denoted by , is the minimum cardinality of
a split dominating set in . In this paper, some results on
were obtained in terms of vertices, blocks, and other
different parameters of but not members of
Further, we develop its relationship with other different
domination parameters of
Be the first to like this
A dominating set is a split dominating set in . If the induced subgraph is disconnected in The split domination number of is denoted by , is the minimum cardinality of a split dominating set in . In this paper, some results on were obtained in terms of vertices, blocks, and other different parameters of but not members of Further, we develop its relationship with other different domination parameters of
Total views
284
On Slideshare
0
From embeds
0
Number of embeds
2
Downloads
3
Shares
0
Comments
0
Likes
0
The SlideShare family just got bigger. You now have unlimited* access to books, audiobooks, magazines, and more from Scribd.
Cancel anytime.Join the community of over 1 million readers
Join the community of over 1 million readers
Sign up for a Scribd 60 day free trial to download this document plus get access to the world’s largest digital library.
Cancel anytime.
Be the first to comment