加载中…
For a graph of size , a bijection is a local antimagc labeling if it induces a vertex labeling such that , where is the sum of all the incident edge label(s) of , for every edge . In this paper, we make use of matrices of fixed sizes to construct several families of infinitely many tripartite graphs with local antimagic chromatic number 3.

生成讲解博客的中文版本

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