Bicritical domination

被引：23

作者：

Brigham, RC ^{[1
]}

Haynes, TW

Henning, MA

Rall, DF

机构：

[1] Univ Cent Florida, Dept Math, Orlando, FL 32816 USA

[2] E Tennessee State Univ, Dept Math, Johnson City, TN 37614 USA

[3] Univ KwaZulu Natal, Sch Math Sci, ZA-3209 Pietermaritzburg, South Africa

[4] Furman Univ, Dept Math, Greenville, SC 29613 USA

来源：

DISCRETE MATHEMATICS | 2005年 / 305卷 / 1-3期

关键词：

domination; vertex critical domination; vertex bicritical domination; bounds; diameter;

D O I：

10.1016/j.disc.2005.09.013

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph G is domination bicritical if the removal of any pair of vertices decreases the domination number. Properties of bicritical graphs are studied. We show that a connected bicritical graph has domination number at least 3, minimum degree at least 3, and edge-connectivity at least 2. Ways of constructing a bicritical graph from smaller bicritical graphs are presented. (c) 2005 Elsevier B.V All rights reserved.

引用

页码：18 / 32

页数：15

共 11 条

[1]

[Anonymous], 1991, JCOMBIN MATH COMBIN

[2] VERTEX DOMINATION CRITICAL GRAPHS [J].