| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649149 | Discrete Mathematics | 2010 | 11 Pages |
Abstract
Let γ(G)γ(G) denote the minimum cardinality of a dominating set for GG. A graph GG is said to be kk-γγ-critical if γ(G)=kγ(G)=k, but γ(G+e)
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
W. Ananchuen, N. Ananchuen, R.E.L. Aldred,