2011•Automation and Autonomous SystemsRequires access

Recognizing the Structure of Super Strongly Perfect Graphs Using Perfect Graphs and Strongly Perfect Graphs

R. Mary Jeya Jothi, A. Amutha

Abstract

A Graph G is Super Strongly Perfect Graph if every induced sub graphs H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. We have given results about two important family members of Perfect graphs (i.e.,) Strongly Perfect Graphs and Super Strongly Perfect Graphs. We have discussed the structure of Super Strongly Perfect Graphs for Perfect Graphs like, Bipartite Graphs and Trees. We have also discussed the Super Strongly Perfect Graphs on Planar Graphs, Digraphs and 2 - Connected Graphs. We have found the relation between Strongly Perfect Graphs and Super Strongly Perfect Graphs.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Chordal graph, Indifference graph, Combinatorics, Trivially perfect graph, Strong perfect graph theorem, Pathwidth, Cograph, Mathematics