TWIN DOMINATION AND TWIN IRREDUNDANCE IN DIGRAPHS

被引：8

作者：

Arumugam, S. ^{[1
]}

Ebadi, Karam ^{[1
]}

Sathikala, L. ^{[1
]}

机构：

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

来源：

APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS | 2013年 / 7卷 / 02期

关键词：

Directed graph; twin dominating set; twin irredundant set; twin domination number; twin irredundance number; GRAPH;

D O I：

10.2298/AADM130429007A

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let D = (V, A) be a digraph. A subset S of V is called a twin dominating set of D if for every vertex v is an element of V - S, there exist vertices u(1), u(2) is an element of S (u(1) and u(2) may coincide) such that (v, u(1)) and (u(2), v) are arcs in D. The minimum cardinality of a twin dominating set in D is called the twin domination number of D and is denoted by gamma* (D). In this paper we present several basic results on these and other related parameters.

引用

页码：275 / 284

页数：10

共 8 条

[1]

Arumugam S, 2007, AUSTRALAS J COMB, V39, P283

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

BOLLOBAS, B ;

COCKAYNE, EJ .

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

[3]

Chartrand G, 2003, ARS COMBINATORIA, V67, P105

[4]

Chartrand G., 1996, Congr. Numer., V119, P51

[5]

Chartrand G., 2004, GRAPHS DIGRAPHS, Vfourth

[6]

Cockayne E.J., 1978, Canad. Math. Bull., V21, P461

[7] DOMINATING SET AND CONVERSE DOMINATING SET OF A DIRECTED GRAPH [J].

FU, Y .

AMERICAN MATHEMATICAL MONTHLY, 1968, 75 (08) :861-+

[8]

Haynes T.W., 1998, Chapman & Hall/CRC Pure and Applied Mathematics

← 1 →