eduzhai > Applied Sciences > Engineering >

Fair Secure Dominating Set in the Corona of Graphs

  • Save

... pages left unread,continue reading

Document pages: 6 pages

Abstract: In this paper, we extend the concept of fair secure dominating sets by characterizing the corona of two nontrivial connected graphs and give some important results.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×