Author
Abstract
Let G be a graph with vertex set V and no isolated vertices, and let S be a dominating set of V. The set S is a semitotal dominating set of G if every vertex in S is within distance 2 of another vertex of S. And, S is a semipaired dominating set of G if S can be partitioned into 2-element subsets such that the vertices in each 2-set are at most distance two apart. The semitotal domination number $$\gamma _\mathrm{t2}(G)$$ γ t 2 ( G ) is the minimum cardinality of a semitotal dominating set of G, and the semipaired domination number $$\gamma _\mathrm{pr2}(G)$$ γ pr 2 ( G ) is the minimum cardinality of a semipaired dominating set of G. For a graph without isolated vertices, the domination number $$\gamma (G)$$ γ ( G ) , the total domination $$\gamma _t(G)$$ γ t ( G ) , and the paired domination number $$\gamma _\mathrm{pr}(G)$$ γ pr ( G ) are related to the semitotal and semipaired domination numbers by the following inequalities: $$\gamma (G) \le \gamma _\mathrm{t2}(G) \le \gamma _t(G) \le \gamma _\mathrm{pr}(G)$$ γ ( G ) ≤ γ t 2 ( G ) ≤ γ t ( G ) ≤ γ pr ( G ) and $$\gamma (G) \le \gamma _\mathrm{t2}(G) \le \gamma _\mathrm{pr2}(G) \le \gamma _\mathrm{pr}(G) \le 2\gamma (G)$$ γ ( G ) ≤ γ t 2 ( G ) ≤ γ pr 2 ( G ) ≤ γ pr ( G ) ≤ 2 γ ( G ) . Given two graph parameters $$\mu $$ μ and $$\psi $$ ψ related by a simple inequality $$\mu (G) \le \psi (G)$$ μ ( G ) ≤ ψ ( G ) for every graph G having no isolated vertices, a graph is $$(\mu ,\psi )$$ ( μ , ψ ) -perfect if every induced subgraph H with no isolated vertices satisfies $$\mu (H) = \psi (H)$$ μ ( H ) = ψ ( H ) . Alvarado et al. (Discrete Math 338:1424–1431, 2015) consider classes of $$(\mu ,\psi )$$ ( μ , ψ ) -perfect graphs, where $$\mu $$ μ and $$\psi $$ ψ are domination parameters including $$\gamma $$ γ , $$\gamma _t$$ γ t and $$\gamma _\mathrm{pr}$$ γ pr . We study classes of perfect graphs for the possible combinations of parameters in the inequalities when $$\gamma _\mathrm{t2}$$ γ t 2 and $$\gamma _\mathrm{pr2}$$ γ pr 2 are included in the mix. Our results are characterizations of several such classes in terms of their minimal forbidden induced subgraphs.
Suggested Citation
Teresa W. Haynes & Michael A. Henning, 2018.
"Perfect graphs involving semitotal and semipaired domination,"
Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 416-433, August.
Handle:
RePEc:spr:jcomop:v:36:y:2018:i:2:d:10.1007_s10878-018-0303-9
DOI: 10.1007/s10878-018-0303-9
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:36:y:2018:i:2:d:10.1007_s10878-018-0303-9. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.