i-manager Publications

Analysation of Super Strongly Perfectness in Ladder Graphs

Mary Jothi*, A. Amutha**

* Research Scholar, Department of Mathematics, Sathyabama University, Chennai.

** Associate Professor, Department of Mathematics, Sathyabama University, Chennai.

Periodicity:April - June'2013
DOI : https://doi.org/10.26634/jmat.2.2.2313

Abstract

A Graph G is Super Strongly Perfect Graph if every induced subgraph H of G possesses a minimal dominating set that meets all maximal cliques of H. In this paper, the authors have given a characterization of Super Strongly Perfect graphs. Using this characterization they have characterized the Super Strongly Perfect graphs in Ladder graphs. They have investigated the structure of Super Strongly Perfect Graphs in Ladder graphs. Also they have found the relation between domination number, co-domination number and diameter of Ladder Graphs.

Keywords

Super Strongly Perfect Graph, Minimal Dominating Set, Ladder Graph, Domination and Co-Domination Numbers

How to Cite this Article?

Jothi, R.M.J., and Amutha, A. (2013). Analysation of Super Strongly Perfectness in Ladder Graphs. i-manager’s Journal on Mathematics, 2(2), 17-21. https://doi.org/10.26634/jmat.2.2.2313

References

[1]. Amutha A and Mary Jeya Jothi. R, (2012). “Characterization of Super Strongly Perfect Graphs in Bipartite Graphs”, Proceedings of an International Conference in Engineering and Business Management (ICMEB 2012), 1:183 - 185.

[2]. Bondy J. A and Murty U.S.R, (1976). “Graph Theory with Applications”, Elsevier Science Publishing Company Inc., New York.

[3]. Foulds. R, (1994). “Graph Theory Applications”, Springer, New York.

[4]. Hosoya. H and Harary, F. (1993). “On the Matching Properties of Three Fence Graphs” J. Math. Chem., 12:211-218.

[5]. Murty. U.S.R, (2006). “Open problems”, Trends in Mathematics, 381–389.

[6]. Rogers. D. G, (1982). “The Enumeration of a family of Ladder Graphs”, Information Processing Letters, 15:179-182.

[7]. Skiena. S, (1990). “Grid Graphs” In Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, Addison-Wesley publications, 147-148.

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Pdf	35	35	200	20
Online	35	35	200	15
Pdf & Online	35	35	400	25

Analysation of Super Strongly Perfectness in Ladder Graphs

Abstract

Keywords

How to Cite this Article?

References

If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Options for accessing this content: