| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9512121 | Discrete Mathematics | 2005 | 15 Pages |
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
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Robert C. Brigham, Teresa W. Haynes, Michael A. Henning, Douglas F. Rall,