On local antimagic chromatic number of graphs

DOI10.22044/JAS.2019.7933.1391MaRDI QIDQ4956449zbMATH OpenOpenAlexFDO

Authors Saeed Shaebani

Publication date 2 September 2021

Full work available at URL https://arxiv.org/abs/1804.08867

zbMATH Keywords

antimagic labelinglocal antimagic chromatic numberlocal antimagic labeling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: A {it local antimagic labeling} of a connected graph $G$ with at least three vertices, is a bijection $f:E(G)ightarrow1,2,ldots,|E(G)|$ such that for any two adjacent vertices $u$ and $v$ of $G$, the condition $omeg{a}_f(u)eqomeg{a}_f(v)$ holds; where $omeg{a}_f(u)=su{m}_{xinN(u)}f(xu)$. Assigning $omeg{a}_f(u)$ to $u$ for each vertex $u$ in $V(G)$, induces naturally a proper vertex coloring of $G$; and $|f|$ denotes the number of colors appearing in this proper vertex coloring. The {it local antimagic chromatic number} of $G$, denoted by $ch{i}_{la}(G)$, is defined as the minimum of $|f|$, where $f$ ranges over all local antimagic labelings of $G$. In this paper, we explicitely construct an infinite class of connected graphs $G$ such that $ch{i}_{la}(G)$ can be arbitrarily large while $$, where $$ is the join graph of $G$ and the complement graph of $K_2$. This fact leads to a counterexample to a theorem of [Local antimagic vertex coloring of a graph, {em Graphs and Combinatorics} {�f 33} (2017), 275--285].

Recommendations

• On local antimagic chromatic number of cycle-related join graphs
• Affirmative solutions on local antimagic chromatic number
• Local antimagic vertex coloring of a graph
• Local vertex antimagic chromatic number of some wheel related graphs
• Approaches that output infinitely many graphs with small local antimagic chromatic number

Cites work

• scientific article; zbMATH DE number 47933 (Why is no real title available?)
• A dynamic survey of graph labeling
• Anti-magic labeling of trees
• Graphs of large linear size are antimagic
• Local antimagic vertex coloring of a graph
• On a combination of the 1-2-3 conjecture and the antimagic labelling conjecture
• Proof of a local antimagic conjecture

Cited in

(22)

• Local antimagic vertex coloring of a graph
• On local antimagic chromatic number of cycle-related join graphs
• On local antimagic total labeling of complete graphs amalgamation
• On local antimagic chromatic number of cycle-related join graphs. II
• On local distance antimagic chromatic number of graphs disjoint union with 1-regular graphs
• On local antimagic chromatic number of graphs with cut-vertices
• On $(a,d)$-edge local antimagic coloring number of graphs
• scientific article; zbMATH DE number 7714501 (Why is no real title available?)
• Affirmative solutions on local antimagic chromatic number
• Local Anti-Ramsey Numbers of Graphs
• On local antimagic chromatic number of various join graphs
• On the local antimagic chromatic number of the lexicographic product of graphs
• Every graph is local antimagic total and its applications
• Approaches that output infinitely many graphs with small local antimagic chromatic number
• On local antimagic chromatic numbers of circulant graphs join with null graphs or cycles
• Local distance antimagic chromatic number for the union of star and double star graphs
• Local antimagic chromatic number for the corona product of wheel and null graphs
• Local vertex antimagic chromatic number of some wheel related graphs
• Chromatic number of super vertex local antimagic total labelings of graphs
• On join product and local antimagic chromatic number of regular graphs
• On local antimagic chromatic number of lexicographic product graphs
• Local distance antimagic chromatic number for the union of complete bipartite graphs

This page was built for publication: On local antimagic chromatic number of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956449)