Skip to main content
Log in

A note on domination and total domination in prisms

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Recently, Azarija et al. (Electron J Combin:1.19, 2017) considered the prism \(G \mathop {\square }K_2\) of a graph G and showed that \(\gamma _t(G \mathop {\square }K_2) = 2\gamma (G)\) if G is bipartite, where \(\gamma _t(G)\) and \(\gamma (G)\) are the total domination number and the domination number of G. In this note, we give a simple proof and observe that there are similar results for other pairs of parameters. We also answer a question from that paper and show that for all graphs \(\gamma _t(G \mathop {\square }K_2) \ge \frac{4}{3}\gamma (G)\), and this bound is tight.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wayne Goddard.

Additional information

Michael A. Henning research supported in part by the South African National Research Foundation and the University of Johannesburg.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Goddard, W., Henning, M.A. A note on domination and total domination in prisms. J Comb Optim 35, 14–20 (2018). https://doi.org/10.1007/s10878-017-0150-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-017-0150-0

Keywords

Mathematics Subject Classification