• Communications of the Korean Mathematical Society
• /
• v.32 no.4
• /
• pp.805-810
• /
• 2017

Let $C_n$ be the cycle graph of order n on the vertices $v_0,v_1,{\ldots},v_n$ and $C^k_n$ be the k-th power of $C_n$. In this article we determine the hull-number of $C^k_n$.

• 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.