<article_id>JMAT_V2_N2_RP2</article_id>
<title>Analysation of Super Strongly Perfectness in Ladder Graphs</title>
<author>R. Mary Jeya Jothi</author>
<author>A. Amutha</author>
<journal>Journal on Mathematics</journal>
<issn>2277-5137</issn>
<volume>2</volume>
<issue>2</issue>
<first_page>17</first_page>
<last_page>21</last_page>
<keywords>Super Strongly Perfect Graph, Minimal Dominating Set, Ladder Graph, Domination and Co-Domination Numbers</keywords>
<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.</abstract>
<date>April - June 2013</date>
<copyright>Copyright &copy; 2013 i-manager publications. All rights reserved.</copyright>
<publisher>i-manager Publications</publisher>
<article_url>http://www.imanagerpublications.com/Article.aspx?ArticleId=2313</article_url>