Clique regular graphs

R. S. Bhat, Surekha R. Bhat, Smitha G. Bhat, Sayinath Udupa

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)263-270
Number of pages8
JournalPertanika Journal of Science and Technology
Volume25
Issue number1
Publication statusPublished - 01-01-2017

All Science Journal Classification (ASJC) codes

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

Cite this

Bhat, R. S., Bhat, S. R., Bhat, S. G., & Udupa, S. (2017). Clique regular graphs. Pertanika Journal of Science and Technology, 25(1), 263-270.
Bhat, R. S. ; Bhat, Surekha R. ; Bhat, Smitha G. ; Udupa, Sayinath. / Clique regular graphs. In: Pertanika Journal of Science and Technology. 2017 ; Vol. 25, No. 1. pp. 263-270.
@article{51ea55bcc9f9452c99d9b8e9c45f3a9e,
title = "Clique regular graphs",
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.",
author = "Bhat, {R. S.} and Bhat, {Surekha R.} and Bhat, {Smitha G.} and Sayinath Udupa",
year = "2017",
month = "1",
day = "1",
language = "English",
volume = "25",
pages = "263--270",
journal = "Pertanika Journal of Science and Technology",
issn = "0128-7680",
publisher = "Universiti Putra Malaysia",
number = "1",

}

Bhat, RS, Bhat, SR, Bhat, SG & Udupa, S 2017, 'Clique regular graphs', Pertanika Journal of Science and Technology, vol. 25, no. 1, pp. 263-270.

Clique regular graphs. / Bhat, R. S.; Bhat, Surekha R.; Bhat, Smitha G.; Udupa, Sayinath.

In: Pertanika Journal of Science and Technology, Vol. 25, No. 1, 01.01.2017, p. 263-270.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Clique regular graphs

AU - Bhat, R. S.

AU - Bhat, Surekha R.

AU - Bhat, Smitha G.

AU - Udupa, Sayinath

PY - 2017/1/1

Y1 - 2017/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=85011573530&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85011573530&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85011573530

VL - 25

SP - 263

EP - 270

JO - Pertanika Journal of Science and Technology

JF - Pertanika Journal of Science and Technology

SN - 0128-7680

IS - 1

ER -

Bhat RS, Bhat SR, Bhat SG, Udupa S. Clique regular graphs. Pertanika Journal of Science and Technology. 2017 Jan 1;25(1):263-270.