Tree domatic number in graphs
A dominating set \(S\) in a graph \(G\) is a tree dominating set of \(G\) if the subgraph induced by \(S\) is a tree. The tree domatic number of \(G\) is the maximum number of pairwise disjoint tree dominating sets in \(V(G)\). First, some exact values of and sharp bounds for the tree domatic number...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2007-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol27/1/art/opuscula_math_2701.pdf |