Skip to main content

γ-Chromatic Partition in Planar Graph Characterization

  • Conference paper
  • First Online:
Applied Mathematics and Scientific Computing

Part of the book series: Trends in Mathematics ((TM))

  • 614 Accesses

Abstract

A uniquely colorable graph G whose chromatic partition contains at least one γ-set is termed as a γ-uniquely colorable graph. We characterize the planarity of these graphs using the domination number of G.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 169.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

Institutional subscriptions

References

  1. Akiyama, J., Harary, F.: A Graph and its Complement with Specified Properties. I: Connectivity, Internat. J. Math Science. 2, 223–228 (1979).

    Google Scholar 

  2. Arumugam, A. Ismail Sahul Hamid, I., Muthukamatchi, A.: Independent domination and graph colorings. Proceeding. of ICDM. 195–203 (2006).

    Google Scholar 

  3. Battle, B.J., Harary, F., Yukihiro: Every planar graph with nine points has a non planar complement. Communicated by Roger Lyndon. 68, 569–571 (1962).

    MATH  Google Scholar 

  4. Bing Zhou: On the maximum number of dominating classes in graph coloring. Open Journal of Discrete Mathematics. 6, 70–73 (2016).

    Google Scholar 

  5. Harary, F. 2011. Graph Theory. Addison Wesely, Narosa Publishing House.

    MATH  Google Scholar 

  6. Haynes,T. W., Hedetniemi, S. T. and Slater, P. J. 1998. Fundamentals of Domination in Graphs, Marcel Dekker, New York.

    MATH  Google Scholar 

  7. Rosa, I., Enciso Ronald, Dutton, D.: Global Domination in Planar Graphs. http://www.cs.ucf.edu/ renciso/Global Domination in Planar Grap.pdf.

  8. Val Pinciu: Dominating Sets for Outerplanar Graphs. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.412.8672&rep=rep1&type=pdf.

  9. Yamuna, M., Karthika,K.: Planar Graph Characterization - Using γ - Stable Graphs, WSEAS Transactions on Mathematics.13, 493–504 (2014).

    Google Scholar 

  10. Yamuna, M., Elakkiya, A.: γ - Uniquely colorable graphs, IOP Conf. Series: Materials Science and Engineering. 263 (2017).

    Google Scholar 

  11. Yamuna, M., Elakkiya, A.: Planar graph characterization of γ - Uniquely colorable graphs, IOP Conf. Series: Materials Science and Engineering. 263 (2017).

    Google Scholar 

  12. Yamuna, M., Elakkiya, A.: Non domination subdivision stable graphs, IOP Conf. Series: Materials Science and Engineering. 263 (2017).

    Google Scholar 

  13. Yamuna, M., Elakkiya, A.: Planar graph characterization of NDSS graphs, IOP Conf. Series: Materials Science and Engineering. 263 (2017).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. Yamuna .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yamuna, M., Elakkiya, A. (2019). γ-Chromatic Partition in Planar Graph Characterization. In: Rushi Kumar, B., Sivaraj, R., Prasad, B., Nalliah, M., Reddy, A. (eds) Applied Mathematics and Scientific Computing. Trends in Mathematics. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-01123-9_45

Download citation

Publish with us

Policies and ethics