Title

Bicritical domination

Authors

Authors

R. C. Brigham; T. W. Haynes; M. A. Henning;D. F. Rall

Comments

Authors: contact us about adding a copy of your work at STARS@ucf.edu

Abbreviated Journal Title

Discret. Math.

Keywords

domination; vertex critical domination; vertex bicritical domination; bounds; diameter; CRITICAL GRAPHS; Mathematics

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. (c) 2005 Elsevier B.V All rights reserved.

Journal Title

Discrete Mathematics

Volume

305

Issue/Number

1-3

Publication Date

1-1-2005

Document Type

Article

Language

English

First Page

18

Last Page

32

WOS Identifier

WOS:000234159800002

ISSN

0012-365X

Share

COinS