Abstract
A subset $S$ of $V(G)$ is a double dominating set of a graph $G$ if $S$ dominates every vertex of $G$ at least twice. The minimum cardinality of a double dominating set denoted by $\gamma_{2\times}(G)$, is the double domination number of $G$. In this paper, we identified the double domination number of graphs generated by applying various unary operations on standard graph classes.
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.
