Approaches that output infinitely many graphs with small local antimagic chromatic number

DOI10.1142/S1793830922500793MaRDI QIDQ6174162zbMATH OpenOpenAlexFDO

Authors Gee-Choon Lau, Jianxi Li, Wai Chee Shiu

Publication date 14 July 2023

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

bipartitetripartitelocal antimagic chromatic numberlocal antimagic labeling

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: An edge labeling of a connected graph $G=(V,E)$ is said to be local antimagic if it is a bijection $f:Eo1,ldots,|E|$ such that for any pair of adjacent vertices $x$ and $y$, $f^{+}(x)ot=f^{+}(y)$, where the induced vertex label $f^{+}(x)=sumf(e)$, with $e$ ranging over all the edges incident to $x$. The local antimagic chromatic number of $G$, denoted by $ch{i}_{la}(G)$, is the minimum number of distinct induced vertex labels over all local antimagic labelings of $G$. In this paper, we (i) give a sufficient condition for a graph with one pendant to have $ch{i}_{la}ge3$. A necessary and sufficient condition for a graph to have $ch{i}_{la}=2$ is then obtained; (ii) give a sufficient condition for every circulant graph of even order to have $ch{i}_{la}=3$; (iii) construct infinitely many bipartite and tripartite graphs with $ch{i}_{la}=3$ by transformation of cycles; (iv) apply transformation of cycles to obtain infinitely many one-point union of regular (possibly circulant) or bi-regular graphs with $ch{i}_{la}=2,3$. The work of this paper suggests many open problems on the local antimagic chromatic number of bipartite and tripartite graphs.

Recommendations

• On local antimagic chromatic number of graphs
• Affirmative solutions on local antimagic chromatic number
• On local antimagic chromatic number of cycle-related join graphs
• Local antimagic vertex coloring of a graph
• Local vertex antimagic chromatic number of some wheel related graphs

Cites work

• scientific article; zbMATH DE number 47933 (Why is no real title available?)
• Affirmative solutions on local antimagic chromatic number
• Antimagic labeling of regular graphs
• Antimagic orientation of Halin graphs
• Dense graphs are antimagic
• Graph theory with applications
• Graphs of large linear size are antimagic
• Local antimagic chromatic number of trees - I
• Local antimagic labeling of graphs
• Local antimagic vertex coloring of a graph
• On local antimagic chromatic number of cycle-related join graphs
• On number of pendants in local antimagic chromatic number
• On the rank of cyclic latin squares
• Proof of a local antimagic conjecture
• Regular bipartite graphs are antimagic
• Regular graphs of odd degree are antimagic

Cited in

(5)

• On local antimagic total labeling of complete graphs amalgamation
• Every graph is local antimagic total and its applications
• On local antimagic chromatic number of graphs
• On join product and local antimagic chromatic number of regular graphs
• On local antimagic chromatic number of lexicographic product graphs

This page was built for publication: Approaches that output infinitely many graphs with small local antimagic chromatic number

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