Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithmic Applications in Management

AAIM 2021: Algorithmic Aspects in Information and Management pp 418–425Cite as

Restrained and Total Restrained Domination in Cographs

  • Conference paper
  • First Online:

  • 445 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 13153))

Abstract

Let \(\gamma _{r}(G)\) and \(\gamma _{tr}(G)\) denote the restrained domination number and total restrained domination number of G, respectively. The minimum total restrained domination problem is to find a total restrained dominating set of minimum cardinality. In this paper, we correct a minor error in Pandey et al. [5] and design a linear-time algorithm for finding the restrained domination number of cographs. Furthermore, we propose a linear-time algorithm to solve the minimum total restrained domination problem in cographs.

This research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2020R1I1A3A04036669).

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Araki, T., Yamanaka, R.: Secure domination in cographs. Discrete Appl. Math. (2019). in press. https://doi.org/10.1016/j.dam.2019.02.043

  2. Domke, G.S., Hattingh, J.H., Hedetniemi, S.T., Laskar, R.C., Markus, L.R.: Restrained domination in graphs. Discrete Math. 203(1–3), 61–69 (1999)

    Article  MathSciNet  Google Scholar 

  3. Joubert, E.: Total restrained domination in claw-free graphs with minimum degree at least two. Discrete Appl. Math. 159, 2078–2097 (2011)

    Article  MathSciNet  Google Scholar 

  4. Panda, B.S., Pradhan, D.: A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs. Discrete Math. Algorithms Appl. (2015). https://doi.org/10.1142/S1793830915500202

  5. Pandey, A., Panda, B.S.: Some algorithmic results on restrained domination in graphs (2016). arXiv:1606.02340v1 [cs.DM]

  6. Ma, D.X., Chen, X.G., Sun, L.: On total restrained domination in graphs. Czechoslov. Math. J. 55(1), 165–173 (1999)

    Article  MathSciNet  Google Scholar 

  7. Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial \(k\)-trees. SIAM J. Discrete Math. 10, 529–550 (1997)

    Article  MathSciNet  Google Scholar 

  8. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker Inc., New York (1998)

    MATH  Google Scholar 

  9. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker Inc., New York (1998)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics, North China Electric Power University, Beijing, 102206, China

    Xue-gang Chen

  2. Mathematics, Changwon National University, Changwon, 641-773, Korea

    Moo Young Sohn

Authors
  1. Xue-gang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Moo Young Sohn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Moo Young Sohn .

Editor information

Editors and Affiliations

  1. The University of Texas at Dallas, Richardson, TX, USA

    Weili Wu

  2. Harbin Institute of Technology, Shenzhen, China

    Hongwei Du

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chen, Xg., Sohn, M.Y. (2021). Restrained and Total Restrained Domination in Cographs. In: Wu, W., Du, H. (eds) Algorithmic Aspects in Information and Management. AAIM 2021. Lecture Notes in Computer Science(), vol 13153. Springer, Cham. https://doi.org/10.1007/978-3-030-93176-6_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-93176-6_36

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-93175-9

  • Online ISBN: 978-3-030-93176-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation