Skip to main content
SpringerLink
Log in
Book cover

Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS 2012), December 28-30, 2012 pp 279–285Cite as

An Investigation on the Structure of Super Strongly Perfect Graphs on Trees

  • Conference paper
  • First Online:

  • 1671 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 236))

Abstract

A graph G is super strongly perfect graph if every induced subgraph H of G possesses a minimal dominating set that meets all the maximal cliques of H. In this paper, we have characterized the super strongly perfect graphs on trees. We have presented the results on trees in terms of domination and codomination numbers \({\upgamma }\) and \(\overline{\upgamma }\). Also, we have given the relationship between diameter, domination, and codomination numbers in trees.

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   259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.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. Foulds, R.: Graph theory applications. Springer, New York (1994)

    Google Scholar 

  2. Cayley, A.: On the theory of analytic forms called trees. Philos. Mag. 13, 19–30 (1857)

    Google Scholar 

  3. Cayley, A.: On the theory of analytic forms called trees. Mathematical Papers (Cambridge) 3, 242–246 (1891)

    Google Scholar 

  4. Bondy, J.A., Murty, U.S.R.: Graph theory with applications. Elsevier Science Publishing Company Inc., New York (1976)

    MATH  Google Scholar 

  5. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in graphs advanced topic. Marcel Dekker, Inc., New York (1998)

    Google Scholar 

  6. Amutha, A., Mary Jeya Jothi, R. : Characterization of super strongly perfect graphs. In: Bipartite graphs, proceedings of an international conference on mathematical modelling and scientific computation, 1, 183–185 (2012).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Scholar, Department of Mathematics, Sathyabama University, Chennai, 600119, India

    R. Mary Jeya Jothi

  2. Assistant Professor, Department of Mathematics, Sathyabama University, Chennai, 600119, India

    A. Amutha

Authors
  1. R. Mary Jeya Jothi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Amutha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Mary Jeya Jothi .

Editor information

Editors and Affiliations

  1. Institute of Engineering and Technology, JK Lakshmipat University, Jaipur, Rajasthan, India

    B. V. Babu

  2. Department of Computer Science, Liverpool Hope University, Liverpool, United Kingdom

    Atulya Nagar

  3. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, Uttarakhand, India

    Kusum Deep

  4. Department of Paper Technology, Indian Institute of Technology Roorkee, Roorkee, India

    Millie Pant

  5. Department of Applied Mathematics, South Asian University, New Delhi, India

    Jagdish Chand Bansal

  6. Institute of Engineering and Technology, JK Lakshmipat University, Jaipur, Rajasthan, India

    Kanad Ray

  7. Institute of Engineering and Technology, JK Lakshmipat University, Jaipur, Rajasthan, India

    Umesh Gupta

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer India

About this paper

Cite this paper

Mary Jeya Jothi, R., Amutha, A. (2014). An Investigation on the Structure of Super Strongly Perfect Graphs on Trees. In: Babu, B., et al. Proceedings of the Second International Conference on Soft Computing for Problem Solving (SocProS 2012), December 28-30, 2012. Advances in Intelligent Systems and Computing, vol 236. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1602-5_31

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-1602-5_31

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-1601-8

  • Online ISBN: 978-81-322-1602-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation