• Title/Summary/Keyword: powers of cycles graphs

Search Result 2, Processing Time 0.015 seconds

ON CO-WELL COVERED GRAPHS

  • Abughazaleh, Baha';Abughneim, Omar;Al-Ezeh, Hasan
    • Communications of the Korean Mathematical Society
    • /
    • v.35 no.2
    • /
    • pp.359-370
    • /
    • 2020
  • A graph G is called a well covered graph if every maximal independent set in G is maximum, and co-well covered graph if its complement is a well covered graph. We study some properties of a co-well covered graph and we characterize when the join, the corona product, and cartesian product are co-well covered graphs. Also we characterize when powers of trees and cycles are co-well covered graphs. The line graph of a graph which is co-well covered is also studied.