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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Foulds, R.: Graph theory applications. Springer, New York (1994)
Cayley, A.: On the theory of analytic forms called trees. Philos. Mag. 13, 19–30 (1857)
Cayley, A.: On the theory of analytic forms called trees. Mathematical Papers (Cambridge) 3, 242–246 (1891)
Bondy, J.A., Murty, U.S.R.: Graph theory with applications. Elsevier Science Publishing Company Inc., New York (1976)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in graphs advanced topic. Marcel Dekker, Inc., New York (1998)
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).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)