Skip to main content

Corona Domination Number of Graphs

  • Conference paper
  • First Online:

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 376))

Abstract

We initiate a study of the domination parameter for graph which is defined as “a dominating set S of a graph G is said to be a corona dominating set (CD-set), if every vertex in \(<S>\) is either a pendent vertex or a support vertex. The minimum cardinality of a CD-set is called as corona domination number and is denoted by \(\gamma _{\text {CD}}(G)\)”. In this paper, we initiate a study of this parameter and obtained its results for some derived graphs of path and cycle.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Chartarnd, G., Lesniak, L.: Graphs and Digraphs. CRC (2005)

    Google Scholar 

  2. Cockayne, E.J., Dawes, R.M., Hedetniemi, S.T.: Total domination in graphs. Network 10, 211–219 (1980)

    Article  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  5. Haynes, T.W., Slater, P.J.: Paired domination in graphs. Networks 32, 199–209 (1998)

    Article  MathSciNet  Google Scholar 

  6. Sivagnanam, C.: Neighborhood connected domination number of total graphs. Gen. Math. Notes 25(1), 27–32 (2014)

    MATH  Google Scholar 

  7. Studer, D.S., Haynes, T.W., Lawson, L.M.: Induce-paired domination in graphs. Ars. Comb. 57, 111–128 (2000)

    MATH  Google Scholar 

Download references

Acknowledgements

The research work was supported by the Research seed money for the project proposal of the Department of Mathematics, Gandhigram Rural Institute-Deemed to be University, Gandhigram.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mahadevan, G., Vimala Suganthi, M., Sivagnanam, C. (2021). Corona Domination Number of Graphs. In: Balasubramaniam, P., Ratnavelu, K., Rajchakit, G., Nagamani, G. (eds) Mathematical Modelling and Computational Intelligence Techniques. ICMMCIT 2021. Springer Proceedings in Mathematics & Statistics, vol 376. Springer, Singapore. https://doi.org/10.1007/978-981-16-6018-4_16

Download citation

Publish with us

Policies and ethics