加载中…
An edge labeling of a connected graph is said to be local antimagic if it is a bijection such that for any pair of adjacent vertices and , , where the induced vertex label , with ranging over all the edges incident to . The local antimagic chromatic number of , denoted by , is the minimum number of distinct induced vertex labels over all local antimagic labelings of . In this paper, we characterize -bridge graphs with local antimagic chromatic number 2.

生成讲解博客的中文版本

生成AI智能校验的中文版本