Repository logo

Browsing by Subject "regular graph"

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • thumbnail.journal.alt
    Item type:Thesis, Access status: Restricted ,
    Regularyzacja grafów
    (Data obrony: 2010-10-27) Majmurek, Anna
    Wydział Matematyki Stosowanej
  • thumbnail.journal.alt
    Item type:Thesis, Access status: Restricted ,
    Rozróżnianie wierzchołków grafu przez krotności kolorów incydentnych krawędzi
    (Data obrony: 2013-10-17) Widuch, Justyna
    Wydział Matematyki Stosowanej
  • thumbnail.journal.alt
    Item type:Article, Access status: Open Access ,
    Tree domatic number in graphs
    (2007) Chen, Xuegang
    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$.