نتایج جستجو برای: edge difference chromatic sum
تعداد نتایج: 606034 فیلتر نتایج به سال:
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$.
Let G be a graph whose each component has order at least 3. Let s : E(G) → Zk for some integer k ≥ 2 be an improper edge coloring of G (where adjacent edges may be assigned the same color). If the induced vertex coloring c : V (G) → Zk defined by c(v) = ∑ e∈Ev s(e) in Zk, (where the indicated sum is computed in Zk and Ev denotes the set of all edges incident to v) results in a proper vertex col...
The purpose of this note is to improve Hind's theorem for graphs with large chromatic number by essentially reducing the power of / from | to | + e (the exact statement of our result is given in equations (4)-(6) below). Our proof uses a lemma which in words states that, if we assign to each vertex x in a fc-chromatic r-edge-chromatic multigraph a colour/(x) from {1,2,. . . ,r}, then there exis...
We study edge-sum distinguishing labeling, a type of labeling recently introduced by Z. Tuza (2017) in context games. An ESD an $n$-vertex graph $G$ is injective mapping integers $1$ to $l$ its vertices such that for every edge, the sum on endpoints unique. If $ l$ equals $n$, we speak about canonical labeling. focus primarily structural properties this and show several classes graphs if they h...
An adjacent vertex distinguishing edge-coloring or an avd-coloring of a simple graph G is a proper edge-coloring of G such that no pair of adjacent vertices meets the same set of colors. We prove that every graph with maximum degree ∆ and with no isolated edges has an avd-coloring with at most ∆ + 300 colors, provided that ∆ > 1020. AMS Subject Classification: 05C15
The only remaining case of a well known conjecture of Vizing states that there is no planar graph with maximum degree 6 and edge chromatic number 7. We introduce parameters for planar graphs, based on the degrees of the faces, and study the question whether there are upper bounds for these parameters for planar edge-chromatic critical graphs. Our results provide upper bounds on these parameters...
The guided modes lying in the upper gap-edge band in the photonic band structure of photonic crystals have negative values of refractive index. This feature generates many interesting optical phenomena, and some spectacular photonic devices such as focusing slabs have been developed. We report the design of a photonic-crystal, planoconcave lens for focusing incident parallel light, and theoreti...
The chromatic sum Σ(G) of a graph G is the smallest sum of colors among all proper colorings with natural numbers. The strength s(G) of G is the minimum number of colors needed to achieve the chromatic sum. We construct for each positive integer k a tree Tk with strength k that has maximum degree only 2k − 2. The result is best possible.
the corona product $gcirc h$ of two graphs $g$ and $h$ isobtained by taking one copy of $g$ and $|v(g)|$ copies of $h$;and by joining each vertex of the $i$-th copy of $h$ to the$i$-th vertex of $g$, where $1 leq i leq |v(g)|$. in thispaper, exact formulas for the eccentric distance sum and the edgerevised szeged indices of the corona product of graphs arepresented. we also study the conditions...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید