en عمومى General پژوهشي Research paper <div style="text-align: justify;">An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f:E &rarr;{1,... ,|E|} such that for any pair of adjacent vertices x and y, f⁺(x)&ne; f⁺(y), where the induced vertex label f⁺(x)=&nbsp;&sum; f(e), with e ranging over all the edges incident to x. &nbsp;The local antimagic chromatic number of G, denoted by X_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, Graphs and Combin., 33, (2017), &nbsp;275--285].</div> Local antimagic labeling, Local antimagic chromatic number, Cut-vertices, Pendants. 1 17 http://ijmsi.ir/browse.php?a_code=A-10-2087-4&slc_lang=en&sid=1 Gee-Choon Lau geeclau@yahoo.com 100319475328460010616 100319475328460010616 Yes Faculty of Computer & Mathematical Sciences, Universiti Teknologi MARA (UiTM) Malaysia Wai-Chee Shiu wcshiu@associate.hkbu.edu.hk 100319475328460010617 100319475328460010617 No Department of Mathematics, The Chinese University of Hong Kong, Shatin, Hong Kong Ho-Kuen Ng ho-kuen.ng@sjsu.edu 100319475328460010618 100319475328460010618 No Department of Mathematics, San José State University, San José CA 95192 USA