Structure of super strongly perfect graphs
-
Published:2021-10-12
Issue:
Volume:
Page:
-
ISSN:1793-8309
-
Container-title:Discrete Mathematics, Algorithms and Applications
-
language:en
-
Short-container-title:Discrete Math. Algorithm. Appl.
Author:
Soorya T. E.1,
Mathew Sunil1
Affiliation:
1. Department of Mathematics, National Institute of Technology, Calicut 673 601, India
Abstract
Super strongly perfect graphs and their association with certain other classes of graphs are discussed in this paper. It is observed that every split graph is super strongly perfect. An existing result on super strongly perfect graphs is disproved providing a counter example. It is also established that if a graph [Formula: see text] contains a cycle of odd length, then its line graph [Formula: see text] is not always super strongly perfect. Complements of cycles of length six or above are proved to be non-super strongly perfect. If a graph is strongly perfect, then it is shown that they are super strongly perfect and hence all [Formula: see text]-free graphs are super strongly perfect.
Funder
Kerala State Council for Science, Technology and Environment
Publisher
World Scientific Pub Co Pte Ltd
Subject
Discrete Mathematics and Combinatorics