On Accurate Domination in Graphs
A dominating set of a graph G is a subset D ⊆ VG such that every vertex not in D is adjacent to at least one vertex in D. The cardinality of a smallest dominating set of G, denoted by γ(G), is the domination number of G. The accurate domination number of G, denoted by γa(G), is the cardinality of a...
| Autors principals: | , , |
|---|---|
| Format: | Article |
| Idioma: | English |
| Publicat: |
University of Zielona Góra
2019-08-01
|
| Col·lecció: | Discussiones Mathematicae Graph Theory |
| Matèries: | |
| Accés en línia: | https://doi.org/10.7151/dmgt.2182 |