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...
Tallennettuna:
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
AGH Univeristy of Science and Technology Press
2008-01-01
|
| Sarja: | Opuscula Mathematica |
| Aiheet: | |
| Linkit: | http://www.opuscula.agh.edu.pl/vol28/3/art/opuscula_math_2825.pdf |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|