- Tytuł:
- Tree domatic number in graphs
- Autorzy:
- Chen, X. G.
- Powiązania:
- https://bibliotekanauki.pl/articles/255594.pdf
- Data publikacji:
- 2007
- Wydawca:
- Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
- Tematy:
-
tree domatic number
regular graph
planar graph
Cartesian product - Opis:
- 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 are given. Then, we establish a sharp lower bound for the number of edges in a connected graph of given order and given tree domatic number, and we characterize the extremal graphs. Finally, we show that a tree domatic number of a planar graph is at most 4 and give a characterization of planar graphs with the tree domatic number 3.
- Źródło:
-
Opuscula Mathematica; 2007, 27, 1; 5-11
1232-9274
2300-6919 - Pojawia się w:
- Opuscula Mathematica
- Dostawca treści:
- Biblioteka Nauki
Artykuł