Title
Bicritical Domination
Keywords
Bounds; Diameter; Domination; Vertex bicritical domination; Vertex critical domination
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. © 2005 Elsevier B.V. All rights reserved.
Publication Date
12-6-2005
Publication Title
Discrete Mathematics
Volume
305
Issue
1-3
Number of Pages
18-32
Document Type
Article
Personal Identifier
scopus
DOI Link
https://doi.org/10.1016/j.disc.2005.09.013
Copyright Status
Unknown
Socpus ID
28544440152 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/28544440152
STARS Citation
Brigham, Robert C.; Haynes, Teresa W.; and Henning, Michael A., "Bicritical Domination" (2005). Scopus Export 2000s. 3085.
https://stars.library.ucf.edu/scopus2000/3085