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

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

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

Journal: :transactions on combinatorics 2013
n. paramaguru r. sampathkumar

a modular $k$-coloring, $kge 2,$ of a graph $g$ without isolated vertices is a coloring of the vertices of $g$ with the elements in $mathbb{z}_k$ having the property that for every two adjacent vertices of $g,$ the sums of the colors of the neighbors are different in $mathbb{z}_k.$ the minimum $k$ for which $g$ has a modular $k-$coloring is the modular chromatic number of $g.$ except for some s...

Journal: :The Electronic Journal of Combinatorics 2019

Journal: :Journal of Combinatorial Theory, Series B 1975

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

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