Title

Vertex Domination Critical Graphs

Comments

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

Abbreviated Journal Title

Networks

Keywords

Computer Science; Hardware & Architecture; Operations Research; Management Science

Abstract

A dominating set in a graph G is a set of vertices D such that every vertex of G is either in D or is adjacent some vertex of D. The domination number Γ(G) of G is the minimum cardinality of any dominating set. A graph is vertex domination‐critical if the removal of any vertex decreases its domination number. This paper gives examples and properties of vertex domination‐critical graphs, presents a method of constructing them, and poses some open questions. In the process several results for arbitrary graphs are presented.

Journal Title

Networks

Volume

18

Issue/Number

3

Publication Date

1-1-1988

Document Type

Article

Language

English

First Page

173

Last Page

179

WOS Identifier

WOS:A1988P594400003

ISSN

0028-3045

Share

COinS