Abbreviated Journal Title
domination; vertex critical domination; vertex bicritical domination; bounds; diameter; CRITICAL GRAPHS; Mathematics
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.
"Bicritical domination" (2005). Faculty Bibliography 2000s. 5014.