Two conjectures on 3-domination critical graphs
For a graph G = (V (G), E (G)), a set S ~ V (G) dominates G if each vertex in V (G) \S is adjacent to a vertex in S. The domination number I (G) (independent domination number i (G)) of G is the minimum cardinality amongst its dominating sets (independent dominating sets). G is k-edge-dominati...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2015
|
| Subjects: | |
| Online Access: | Moodley, Lohini (1999) Two conjectures on 3-domination critical graphs, University of South Africa, Pretoria, <http://hdl.handle.net/10500/17505> http://hdl.handle.net/10500/17505 |