A characterization of 3-i-critical graphs of connectivity two
A subset S of V (G) is an independent dominating set of G if S is independent and each vertex of G is either in S or adjacent to some vertex of S. Let i(G) denote the minimum cardinality of an independent dominating set of G. A graph G is k-i-critical if i(G) = k, but i(G + uv) < k for any...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/20.500.11937/59557 |