加载中…
A graph is antimagic if there exists a bijection from to such that the vertex sums for all vertices of are distinct, where the vertex sum is defined as the sum of the labels of all incident edges. Hartsfield and Ringel conjectured that every connected graph other than admits an antimagic labeling. It is still a challenging problem to address antimagicness in the case of disconnected graphs. In this paper, we study antimagicness for the disconnected graph that is constructed as the direct product of a star and a path.

生成讲解博客的中文版本

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