Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/579115| Title: | Clique regular graphs |
| Authors: | Bhat R. S Bhat Surekha R Bhat Smitha G Udupa Sayinath |
| Keywords: | Clique Minimum clique number Maximum clique number Domination number Well covered graphs Clique regular graphs |
| Issue Date: | Jan-2017 |
| Description: | 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 ifand only if is clique regular. We also show that . |
| News Source: | Pertanika Journals |
| ISSN: | 0128-7680 |
| Volume: | 25 |
| Pages: | 263-270 |
| Publisher: | Universiti Putra Malaysia Press |
| Appears in Collections: | Journal Content Pages/ Kandungan Halaman Jurnal |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ukmvital_116463+Source01+Source010.PDF | 772.2 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.