IJPAM: Volume 101, No. 6 (2015)

SSP STRUCTURE OF SOME GRAPH CLASSES

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 if every induced sub graph $H$ of $G$ possesses a minimal dominating set that meets all maximal cliques of $H$. Strongly perfect, complete bipartite graph, etc., are some of the most important classes of super strongly perfect graphs. Here, we analyse the other classes of super strongly perfect graphs like trivially perfect graphs and very strongly perfect graphs. We investigate the structure of super strongly perfect graph in friendship graphs. Also, we discuss the maximal cliques, colourability and dominating sets in friendship graphs.

Received: March 12, 2015

AMS Subject Classification: 05C75

Key Words and Phrases: super strongly perfect graph, trivially perfect graph, very strongly perfect graph and friendship graph

Download paper from here.



DOI: 10.12732/ijpam.v101i6.11 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: 2015
Volume: 101
Issue: 6
Pages: 939 - 948


Google Scholar; DOI (International DOI Foundation); WorldCAT.

CC BY This work is licensed under the Creative Commons Attribution International License (CC BY).