Abstract
In this paper, we study a parameter that is a relaxation of an important domination parameter, namely the paired domination. A set D of vertices in G is a semipaired dominating set of G if it is a dominating set of G and can be partitioned into 2-element subsets such that the vertices in each 2-set are at most distance two apart. The semipaired domination number, γ pr2(G), is the minimum cardinality of a semipaired dominating set of G. For a graph G without isolated vertices, the domination number γ(G), the paired domination number γ pr (G) and the semitotal domination number γ t2(G) are related to the semipaired domination numbers by the following inequalities: γ(G) ≤ γ t2(G) ≤ γ pr2(G) ≤ γ pr (G) ≤ 2γ(G). It means that 1 ≤ γ pr2(G)/γ(G) ≤ 2. In this paper, we characterize those trees that attain the lower bound and the upper bound, respectively.
Sign-in/Register to access full text options 
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.
