Bondage number in oriented graphs

被引：0

作者：

Shan, Erfang ^{[1
]}

Kang, Liying ^{[1
]}

机构：

[1] Shanghai Univ, Dept Math, Shanghai 200436, Peoples R China

来源：

ARS COMBINATORIA | 2007年 / 84卷

关键词：

digraph; domination number; bondage number;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The bondage number b(D) of a digraph D is the cardinality of a smallest set of arcs whose removal from D results in a digraph with domination number greater than the domination number of D. In this paper, we present some upper bounds on bondage number for oriented graphs including tournaments, and symmetric planar digraphs.

引用

页码：319 / 331

页数：13

共 9 条

[1] Bondy J.A., 2008, GRAD TEXTS MATH
[2] Chartrand G, 1999, DISCRETE MATH, V197, P179
[3] Dirac G., 1960, MATH NACHR, V22, P61, DOI DOI 10.1002/MANA.19600220107
[4] THE BONDAGE NUMBER OF A GRAPH
FINK, JF
JACOBSON, MS
KINCH, LF
ROBERTS, J
[J]. DISCRETE MATHEMATICS, 1990, 86 (1-3) : 47 - 57
[5] BOUNDS ON THE BONDAGE NUMBER OF A GRAPH
HARTNELL, BL
RALL, DF
[J]. DISCRETE MATHEMATICS, 1994, 128 (1-3) : 173 - 177
[6] Haynes T.W., 1998, FUNDAMENTALS DOMINAT
[7] Bondage number of planar graphs
Kang, LY
Yuan, JJ
[J]. DISCRETE MATHEMATICS, 2000, 222 (1-3) : 191 - 198
[8] A COUNTEREXAMPLE TO A CONJECTURE ON THE BONDAGE NUMBER OF A GRAPH
TESCHNER, U
[J]. DISCRETE MATHEMATICS, 1993, 122 (1-3) : 393 - 395
[9] On the bondage number of a graph
Wang, YL
[J]. DISCRETE MATHEMATICS, 1996, 159 (1-3) : 291 - 294

← 1 →