"Bicritical Domination" by Robert C. Brigham, Teresa W. Haynes et al.
 

Bicritical Domination

Document Type

Article

Publication Date

12-6-2005

Description

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.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 26
  • Usage
    • Abstract Views: 5
  • Captures
    • Readers: 8
see details

Share

COinS