COMPLETE CHARACTERIZATION OF BRIDGE GRAPHS WITH LOCAL ANTIMAGIC CHROMATIC NUMBER 2

An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f : E -> {1,. .. ,|E| } such that for any pair of adjacent vertices x and y, f(+)(x) not equal f(+)(y), where the induced vertex label f( +)(x) = Sigma f (e), with e ranging over all the edges incident to x. The local antimagic chromatic number of G, denoted by chi(la)(G), is the minimum number of distinct induced vertex labels over all local antimagic labelings of G. In this paper, we characterize s-bridge graphs with local antimagic chromatic number 2.