### Abstract

A maximal complete subgraph of G is a clique. The minimum (maximum) clique number is the order of a minimum (maximum) clique of G. A graph G is clique regular if every clique is of the same order. Two vertices are said to dominate each other if they are adjacent. A set S is a dominating set if every vertex in V- S is dominated by a vertex in S. Two vertices are independent if they are not adjacent. The independent domination number is the order of a minimum independent dominating set of G. The order of a maximum independent set is the independence number. A graph G is well covered if. In this paper it is proved that a graph G is well covered if and only if is clique regular. We also show that.

Original language | English |
---|---|

Pages (from-to) | 263-270 |

Number of pages | 8 |

Journal | Pertanika Journal of Science and Technology |

Volume | 25 |

Issue number | 1 |

Publication status | Published - 01-01-2017 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Science(all)
- Chemical Engineering(all)
- Environmental Science(all)
- Agricultural and Biological Sciences(all)

### Cite this

*Pertanika Journal of Science and Technology*,

*25*(1), 263-270.