On local edge antimagic chromatic number of graphs
نویسندگان
چکیده
Let G = (V,E) be a graph of order p and size q having no isolated vertices. A bijection f : V → {1, 2, 3, ..., p} is called local edge antimagic labeling if for any two adjacent edges e uv e’ vw G, we have w(e) ≠ w(e’), where the weight w(e uv) f(u)+f(v) w(e’) f(v)+f(w). has labeling. The chromatic number χ’lea(G) defined to minimum colors taken over all colorings induced by labelings G. In this paper, determine friendship graph, wheel fan helm flower closed helm.
منابع مشابه
Super ( , - Edge - Antimagic Graphs
A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a one-to-one and onto mapping f from ∪ , ,... , such that the edge weights , ∈ form an AP progression with first term ’a’ and common difference ’d’. The graph G is said to be Super (a,d)-edge-antimagic total labeling if the , , ... , . In this paper we obtain Super (a,d)-edge-antimagic properties of certain cla...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملEdge-face chromatic number and edge chromatic number of simple plane graphs
Given a simple plane graph G, an edge-face k-coloring of G is a function : E(G) [ F (G) ! f1, . . . ,kg such that, for any two adjacent or incident elements a, b 2 E(G) [ F (G), (a) 61⁄4 (b). Let e(G), ef(G), and (G) denote the edge chromatic number, the edge-face chromatic number, and the maximum degree of G, respectively. In this paper, we prove that ef(G) 1⁄4 e(G) 1⁄4 (G) for any 2-connected...
متن کاملOn the independence number of edge chromatic critical graphs
In 1968, Vizing conjectured that for any edge chromatic critical graph G = (V,E) with maximum degree ∆ and independence number α(G), α(G) ≤ |V | 2 . It is known that α(G) < 3∆−2 5∆−2 |V |. In this paper we improve this bound when ∆ ≥ 4. Our precise result depends on the number n2 of 2-vertices in G, but in particular we prove that α(G) ≤ 3∆−3 5∆−3 |V | when ∆ ≥ 5 and n2 ≤ 2(∆− 1).
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proyecciones
سال: 2022
ISSN: ['0716-0917', '0717-6279']
DOI: https://doi.org/10.22199/issn.0717-6279-5339