Graphs with equal domination and independent domination numbers

被引：2

作者：

Gupta, Purnima ^{[1
]}

Singh, Rajesh ^{[2
]}

Arumugam, S. ^{[3
]}

机构：

[1] Univ Delhi, Dept Math, Sri Venkateswara Coll, Delhi, India

[2] Univ Delhi, Dept Math, Ramanujan Coll, Delhi, India

[3] Kalasalingam Univ, Natl Ctr Adv Res Discrete Math, Krishnankoil 626126, Tamil Nadu, India

来源：

AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS | 2020年 / 17卷 / 02期

关键词：

Domination number; independent domination number; 05C69;

D O I：

10.1080/09728600.2020.1833692

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let gamma (G) and i(G) denote the domination number and independent domination number of a graph G. In this article, we establish a sufficient condition for a graph G to satisfy gamma ( G ) = i ( G ) , which yields some of the well known classical theorems as corollaries. Further, we also construct several families of graphs G satisfying gamma (G) = i(G) using the sufficient condition.

引用

页码：691 / 696

页数：6

共 14 条

[1] Quasi-claw-free graphs [J].

Ainouche, A .

DISCRETE MATHEMATICS, 1998, 179 (1-3) :13-26

[2] DOMINATION AND INDEPENDENT DOMINATION NUMBERS OF A GRAPH [J].

ALLAN, RB ;

LASKAR, R .

DISCRETE MATHEMATICS, 1978, 23 (02) :73-76

[3] GRAPH-THEORETIC PARAMETERS CONCERNING DOMINATION, INDEPENDENCE, AND IRREDUNDANCE [J].

BOLLOBAS, B ;

COCKAYNE, EJ .

JOURNAL OF GRAPH THEORY, 1979, 3 (03) :241-249

[4]

Chartrand G., 2005, GRAPHS DIGRAPHS, V4th

[5]

Cockayne EJ, 2000, J GRAPH THEOR, V34, P277, DOI 10.1002/1097-0118(200008)34:4<277::AID-JGT4>3.0.CO

[6]

2-#

[7] A NOTE ON THE CHARACTERIZATION OF DOMINATION PERFECT GRAPHS [J].

FULMAN, J .

JOURNAL OF GRAPH THEORY, 1993, 17 (01) :47-51

[8] Independent domination in graphs: A survey and recent results [J].

Goddard, Wayne ;

Henning, Michael A. .

DISCRETE MATHEMATICS, 2013, 313 (07) :839-854

[9]

Harary F., 1986, Congr. Numer, V55, P121

[10]

Haynes T., 1998, MONOGRAPHS TXB PURE

← 1 2 →