A Classification of Cactus Graphs According to their Domination Number
A set S of vertices in a graph G is a dominating set of G if every vertex not in S is adjacent to some vertex in S. The domination number, γ(G), of G is the minimum cardinality of a dominating set of G. The authors proved in [A new lower bound on the domination number of a graph, J. Comb. Optim. 38...
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
University of Zielona Góra
2022-05-01
|
| Collection: | Discussiones Mathematicae Graph Theory |
| Sujets: | |
| Accès en ligne: | https://doi.org/10.7151/dmgt.2295 |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|