IJPAM: Volume 87, No. 6 (2013)

SUPER STRONGLY PERFECTNESS OF SOME GRAPHS

R. Mary Jeya Jothi$^1$, A. Amutha$^2$
$^{1,2}$Department of Mathematics
Sathyabama University
Chennai, 119, INDIA


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 cliques of $H$. The structure of Super Strongly Perfect Graphs have been characterized by some classes of graphs like Cycle graphs, Circulant graphs, Complete graphs, Complete Bipartite graphs etc., In this paper, we have analysed some other graph classes like, Bicyclic graphs, Dumb bell graphs and Star graphs to characterize the structure of Super Strongly Perfect Graphs in a different way. By this we found the cardinality of minimal dominating set and maximal cliques of the above graphs.

Received: September 6, 2013

AMS Subject Classification: 05C75

Key Words and Phrases: super strongly perfect graph, minimal dominating set, bicyclic graph, dumb bell graph

Download paper from here.



DOI: 10.12732/ijpam.v87i6.5 How to cite this paper?
Source:
International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2013
Volume: 87
Issue: 6