Abstract
Let $G =(V, E)$ be a graph and $uv \in E$ be an edge then $u$ strongly dominates $v$ if $deg(u) \geq deg(v)$. A set $S$ is a $strong$ $dominating$ $set$ ($sd-set$) if every vertex $v \in V-S$ is strongly dominated by some $u$ in $S$. We investigate strong domination number of some path related graphs.
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 Mathematics and Soft Computing
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.
