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...
-д хадгалсан:
| Үндсэн зохиолч: | |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
AGH Univeristy of Science and Technology Press
2008-01-01
|
| Цуврал: | Opuscula Mathematica |
| Нөхцлүүд: | |
| Онлайн хандалт: | http://www.opuscula.agh.edu.pl/vol28/3/art/opuscula_math_2825.pdf |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|