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.
| Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-19592 |
| Date | 06 December 2005 |
| Creators | Brigham, Robert C., Haynes, Teresa W., Henning, Michael A., Rall, Douglas F. |
| Publisher | Digital Commons @ East Tennessee State University |
| Source Sets | East Tennessee State University |
| Detected Language | English |
| Type | text |
| Source | ETSU Faculty Works |
Page generated in 0.0018 seconds