perfect graphs
Recently Published Documents


TOTAL DOCUMENTS

338
(FIVE YEARS 32)

H-INDEX

27
(FIVE YEARS 2)

Author(s):  
T. E. Soorya ◽  
Sunil Mathew

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.


2021 ◽  
Vol 28 (3) ◽  
Author(s):  
Takayuki Hibi ◽  
Dumitru I. Stamate

The classification of complete multipartite graphs whose edge rings are nearly Gorenstein as well as that of finite perfect graphs whose stable set rings are nearly Gorenstein is achieved.


2021 ◽  
Vol 344 (7) ◽  
pp. 112374
Author(s):  
Jake Horsfield ◽  
Kristina Vušković
Keyword(s):  

Author(s):  
Rubul Moran ◽  
Aditya Pegu ◽  
I. J. Gogoi ◽  
A. Bharali
Keyword(s):  

2021 ◽  
Vol 344 (5) ◽  
pp. 112334
Author(s):  
Maria Chudnovsky ◽  
Cemil Dibek ◽  
Paul Seymour
Keyword(s):  

2021 ◽  
Vol 1770 (1) ◽  
pp. 012074
Author(s):  
G. R. Gandal ◽  
R. Mary Jeya Jothi
Keyword(s):  

Author(s):  
Vrinda Mary Mathew ◽  
Joseph Varghese Kureethara
Keyword(s):  

Some of the published results on super strongly perfect graphs are found to be erroneous. We provide some examples and counter examples on the concepts associated with super strongly perfects.


Author(s):  
Csilla Bujtás ◽  
Vesna Iršič ◽  
Sandi Klavžar
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document