A COUNTEREXAMPLE TO A CONJECTURE ON THE BONDAGE NUMBER OF A GRAPH

被引：14

作者：

TESCHNER, U ^{[1
]}

机构：

[1] RHEIN WESTFAL TH AACHEN,LEHRSTUHL MATH 2,W-5100 AACHEN,GERMANY

来源：

DISCRETE MATHEMATICS | 1993年 / 122卷 / 1-3期

关键词：

D O I：

10.1016/0012-365X(93)90317-M

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The bondage number b(G) of a nonempty graph G was first introduced by Fink, Jacobson, Kinch and Roberts in [3]. They generalized a former approach to domination-critical graphs. in their publication they conjectured that b (G) less-than-or-equal-to DELTA(G) + 1 for any nonempty graph G. In this note we present a counterexample for the conjecture.

引用

页码：393 / 395

页数：3

共 4 条

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

BAUER, D ;

HARARY, F ;

NIEMINEN, J ;

SUFFEL, CL .

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

[2] VERTEX DOMINATION CRITICAL GRAPHS [J].

BRIGHAM, RC ;

CHINN, PZ ;

DUTTON, RD .

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

[3] THE BONDAGE NUMBER OF A GRAPH [J].

FINK, JF ;

JACOBSON, MS ;

KINCH, LF ;

ROBERTS, J .

DISCRETE MATHEMATICS, 1990, 86 (1-3) :47-57

[4]

Harary F., 1994, GRAPH THEORY, P11, DOI [DOI 10.21236/AD0705364, 10.1201/9780429493768, DOI 10.1201/9780429493768]

← 1 →