1. UKM Learning and Research Repository
  2. Journal Article / Artikel Jurnal
  3. Journal Content Pages/ Kandungan Halaman Jurnal
Please use this identifier to cite or link to this item: https://ptsldigital.ukm.my/jspui/handle/123456789/579115
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBhat R. S
dc.contributor.authorBhat Surekha R
dc.contributor.authorBhat Smitha G
dc.contributor.authorUdupa
dc.contributor.authorSayinath
dc.date.accessioned2023-11-06T03:15:03Z-
dc.date.available2023-11-06T03:15:03Z-
dc.date.issued2017-01
dc.identifier.issn0128-7680
dc.identifier.otherukmvital:116463
dc.identifier.urihttps://ptsldigital.ukm.my/jspui/handle/123456789/579115-
dc.descriptionA 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 .
dc.language.isoen
dc.publisherUniversiti Putra Malaysia Press
dc.relation.haspartPertanika Journals
dc.relation.urihttp://www.pertanika.upm.edu.my/regular_issues.php?jtype=2&journal=JST-25-1-1
dc.rightsUKM
dc.subjectClique
dc.subjectMinimum clique number
dc.subjectMaximum clique number
dc.subjectDomination number
dc.subjectWell covered graphs
dc.subjectClique regular graphs
dc.titleClique regular graphs
dc.typeJournal Article
dc.format.volume25
dc.format.pages263-270
dc.format.issue1
Appears in Collections:Journal Content Pages/ Kandungan Halaman Jurnal

Files in This Item:
File Description SizeFormat 
ukmvital_116463+Source01+Source010.PDF772.2 kBAdobe PDFThumbnail
View/Open
Show simple item record Recommend this item


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.