Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs
-
Published:2012-09-25
Issue:4
Volume:11
Page:121-131
-
ISSN:0975-3303
-
Container-title:Mapana - Journal of Sciences
-
language:
-
Short-container-title:Mapana J Sc
Author:
Jeya Jothi R Mary,Amutha A
Abstract
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper, we have investigated the characterization of Super Strongly Perfect graphs using odd cycles. We have given the characterization of Super Strongly Perfect graphs in chordal and strongly chordal graphs. We have presented the results of Chordal graphs in terms of domination and co - domination numbers γ and . We have given the relationship between diameter, domination and co - domination numbers of chordal graphs. Also we have analysed the structure of Super Strongly Perfect Graph in Chordal graphs and Strongly Chordal graphs.
Publisher
Christ University Bangalore
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Structural properties of super strongly perfect graphs;Discrete Mathematics, Algorithms and Applications;2018-07-30