Title of article
Bicritical domination Original Research Article
Author/Authors
Robert C. Brigham، نويسنده , , Teresa W. Haynes، نويسنده , , Michael A. Henning، نويسنده , , Douglas F. Rall، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
15
From page
18
To page
32
Abstract
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.
Keywords
Domination , Vertex critical domination , Diameter , Vertex bicritical domination , Bounds
Journal title
Discrete Mathematics
Serial Year
2005
Journal title
Discrete Mathematics
Record number
948313
Link To Document