Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.disc.2005.09.013 | Discrete Mathematics |
Keywords | DocType | Volume |
vertex critical domination,domination,bounds,diameter,vertex bicritical domination | Journal | 305 |
Issue | ISSN | Citations |
1-3 | Discrete Mathematics | 4 |
PageRank | References | Authors |
0.53 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert C. Brigham | 1 | 157 | 26.74 |
| Teresa W. Haynes | 2 | 774 | 94.22 |
| Michael A. Henning | 3 | 1865 | 246.94 |
| Douglas F. Rall | 4 | 422 | 52.18 |