نتایج جستجو برای: total dominator chromatic number

تعداد نتایج: 1837510  

Journal: :transactions on combinatorics 2014
gholamreza omidi khosro tajbakhsh

for a given hypergraph $h$ with chromatic number $chi(h)$ and with no edge containing only one vertex, it is shown that the minimum number $l$ for which there exists a partition (also a covering) ${e_1,e_2,ldots,e_l}$ for $e(h)$, such that the hypergraph induced by $e_i$ for each $1leq ileq l$ is $k$-colorable, is $lceil log_{k} chi(h) rceil$.

Journal: :Axioms 2022

Let G=(V,E) be a connected graph with |V|=n and |E|=m. A bijection f:V(G)∪E(G)→{1,2,⋯,n+m} is called local antimagic total labeling if, for any two adjacent vertices u v, ωt(u)≠ωt(v), where ωt(u)=f(u)+∑e∈E(u)f(e), E(u) the set of edges incident to u. Thus, induces proper coloring G, vertex x in G assigned color ωt(x). The chromatic number, denoted by χlat(G), minimum number colors taken over al...

Journal: :International journal of mathematics and computer research 2022

Fuzzy total chromatic number is the least value of k such that k-fuzzy coloring exist. In this paper, we discussed concept graphs to bistar graph and helm graph. Here define fuzzy Bistar Helm

Journal: :Discrete Mathematics 2017

Journal: :Discrete Mathematics & Theoretical Computer Science 2015
Bostjan Bresar Sandi Klavzar Gasper Kosmrlj Douglas F. Rall

We introduce the concept of guarded subgraph of a graph, which as a condition lies between convex and 2-isometric subgraphs and is not comparable to isometric subgraphs. Some basic metric properties of guarded subgraphs are obtained, and then this concept is applied to the domination game. In this game two players, Dominator and Staller, alternate choosing vertices of a graph, one at a time, su...

Journal: :Discrete Mathematics 2001

Journal: :bulletin of the iranian mathematical society 0
e. momtahan department of mathematics‎, ‎yasouj university‎, ‎yasouj,75914‎, ‎iran. m. baziar department of mathematics‎, ‎yasouj university‎, ‎yasouj,75914‎, ‎iran. s. safaeeyan department of mathematics‎, ‎yasouj university‎, ‎yasouj,75914‎, ‎iran.

let $m$ be an $r$-module and $0 neq fin m^*={rm hom}(m,r)$. we associate an undirected graph $gf$ to $m$ in which non-zero elements $x$ and $y$ of $m$ are adjacent provided that $xf(y)=0$ or $yf(x)=0$. weobserve that over a commutative ring $r$, $gf$ is connected anddiam$(gf)leq 3$. moreover, if $gamma (m)$ contains a cycle,then $mbox{gr}(gf)leq 4$. furthermore if $|gf|geq 1$, then$gf$ is finit...

Journal: :Journal of Combinatorial Theory, Series B 2016

2012
MA Gang

A proper total-coloring of graph G is said to be equitable if the number of elements (vertices and edges) in any two color classes differ by at most one, which the required minimum number of colors is called the equitable total chromatic number. In this paper, we prove some theorems on equitable total coloring and derive the equitable total chromatic numbers of Pm ∨ Sn, Pm ∨ Fn and Pm ∨Wn. Keyw...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید