Title
Vertex Domination Critical Graphs
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
ISSN
0028-3045
Recommended Citation
Brigham, Robert C.; Chinn, Phyllis Z.; and Dutton, Ronald D., "Vertex Domination Critical Graphs" (1988). Faculty Bibliography 1980s. 963.
https://stars.library.ucf.edu/facultybib1980/963
- Citations
- Citation Indexes: 110
- Usage
- Abstract Views: 6
- Captures
- Readers: 8
- Mentions
- References: 3
Comments
Authors: contact us about adding a copy of your work at STARS@ucf.edu