نتایج جستجو برای: total dominator chromatic number
تعداد نتایج: 1837510 فیلتر نتایج به سال:
The domination game played on a graph G consists of two players, Dominator and Staller who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by either player, at least one additional vertex is dominated. Dominator wishes to dominate the graph in as few steps as possible and Staller wishes to delay the process as much as possible. The game domination number γg...
let $f$ be a proper $k$-coloring of a connected graph $g$ and $pi=(v_1,v_2,ldots,v_k)$ be an ordered partition of $v(g)$ into the resulting color classes. for a vertex $v$ of $g$, the color code of $v$ with respect to $pi$ is defined to be the ordered $k$-tuple $c_{{}_pi}(v)=(d(v,v_1),d(v,v_2),ldots,d(v,v_k))$, where $d(v,v_i)=min{d(v,x):~xin v_i}, 1leq ileq k$. if distinct...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید