Some Toughness Results in Independent Domination Critical Graphs
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 pair of non...
Gardado en:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
University of Zielona Góra
2015-11-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Assuntos: | |
| Acceso en liña: | https://doi.org/10.7151/dmgt.1828 |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|