Abstract
A vertex subset [Formula: see text] of a graph [Formula: see text] is a [Formula: see text]-dominating set if each vertex of [Formula: see text] is adjacent to either one or two vertices in [Formula: see text]. The minimum cardinality of a [Formula: see text]-dominating set of [Formula: see text], denoted by [Formula: see text], is called the [Formula: see text]-domination number of [Formula: see text]. In this paper, the [Formula: see text]-domination and the [Formula: see text]-total domination numbers of the generalized Petersen graphs [Formula: see text] are determined.
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.
