On local antimagic chromatic number of graphs with cut-vertices

MaRDI QIDQ6301498zbMATH OpenFDO

Authors Gee-Choon Lau, Wai Chee Shiu, Ho Kuen Ng

Publication date 12 May 2018

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, the sharp lower bound of the local antimagic chromatic number of a graph with cut-vertices given by pendants is obtained. The exact value of the local antimagic chromatic number of many families of graphs with cut-vertices (possibly given by pendant edges) are also determined. Consequently, we partially answered Problem 3.1 in [Local antimagic vertex coloring of a graph, {it Graphs and Combin.}, {�f33} (2017), 275--285.].

This page was built for publication: On local antimagic chromatic number of graphs with cut-vertices

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