Abstract
Let [Formula: see text] be a graph without isolated vertices. A total dominating set of [Formula: see text] is a set [Formula: see text] of vertices of [Formula: see text] such that every vertex of [Formula: see text] is adjacent to at least one vertex in [Formula: see text]. A total dominating set [Formula: see text] is a paired dominating set of [Formula: see text] if the subgraph of [Formula: see text] induced by [Formula: see text] has a perfect matching. The minimum cardinality of a total dominating set (respectively, a paired dominating set) is called the total domination number (respectively, the paired domination number). This paper determines the total domination numbers and the paired domination numbers of windmill 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 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.
