| Summary: | Let (Formula presented.) be a connected graph. A bijection (Formula presented.) is called a local antimagic labeling if, for any two adjacent vertices x and y, (Formula presented.), where (Formula presented.), and (Formula presented.) is the set of edges incident to x. Thus, a local antimagic labeling induces a proper vertex coloring of G, where the vertex x is assigned the color (Formula presented.). The local antimagic chromatic number (Formula presented.) is the minimum number of colors taken over all colorings induced by local antimagic labelings of G. In this paper, we present some families of bridge graphs with (Formula presented.) and give several ways to construct bridge graphs with (Formula presented.). © 2024 by the authors.
|
|---|