Domination by Union of Complete Graphs

被引：0

作者：

Samodivkin, Vladimir ^{[1
]}

机构：

[1] Univ Architecture Civil Engn & Geodesy, Dept Math, Sofia 1046, Bulgaria

来源：

ARS COMBINATORIA | 2010年 / 95卷

关键词：

conditional domination; acyclic domination; independent domination; induced-paired domination; forbidden graph; NUMBERS; SETS;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a graph with domination number gamma(G). A dominating set S subset of V(G) has property UK if all components of the subgraph it induces in G are complete. The union of complete graphs domination number of a graph G, denoted gamma(uk)(G), is the minimum possible size of a dominating set of G, which has property UK. Results on changing and unchanging of gamma(uk) after vertex removal are presented. Also forbidden subgraph conditions sufficient to imply gamma(G) = -gamma(uk)(G) are given.

引用

页码：33 / 43

页数：11

共 14 条

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

ALLAN, RB ;

LASKAR, R .

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

[2]

[Anonymous], 1991, JCOMBIN MATH COMBIN

[3] DOMINATION ALTERATION SETS IN GRAPHS [J].

BAUER, D ;

HARARY, F ;

NIEMINEN, J ;

SUFFEL, CL .

DISCRETE MATHEMATICS, 1983, 47 (2-3) :153-161

[4] VERTEX DOMINATION CRITICAL GRAPHS [J].

BRIGHAM, RC ;

CHINN, PZ ;

DUTTON, RD .

NETWORKS, 1988, 18 (03) :173-179

[5]

Cockayne E.J., 1991, J. Combin. Math. Combin. Comput, V10, P173

[6] DOMINATING CLIQUES IN GRAPHS [J].

COZZENS, MB ;

KELLEHER, LL .

DISCRETE MATHEMATICS, 1990, 86 (1-3) :101-116

[7] VERTEX DOMINATION-CRITICAL GRAPHS [J].

FULMAN, J ;

HANSON, D ;

MACGILLIVRAY, G .

NETWORKS, 1995, 25 (02) :41-43

[8]

HARARY F, 1995, UTILITAS MATHEMATICA, V48, P179

[9]

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

[10] Changing and unchanging domination: a classification [J].

Haynes, TW ;

Henning, MA .

DISCRETE MATHEMATICS, 2003, 272 (01) :65-79

← 1 2 →