On equality in an upper bound for the acyclic domination number
A subset \(A\) of vertices in a graph \(G\) is acyclic if the subgraph it induces contains no cycles. The acyclic domination number \(\gamma_a(G)\) of a graph \(G\) is the minimum cardinality of an acyclic dominating set of \(G\). For any graph \(G\) with \(n\) vertices and maximum degree \(\Delta(G...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
AGH Univeristy of Science and Technology Press
2008-01-01
|
| Schriftenreihe: | Opuscula Mathematica |
| Schlagworte: | |
| Online-Zugang: | http://www.opuscula.agh.edu.pl/vol28/3/art/opuscula_math_2825.pdf |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|