加载中…
In this paper, we give a characterization of unicyclic graphs with diameter at most 4 which are A-vertex magic. Moreover, let G be a bicyclic graph of diameter 3, then G is group vertex magic if and only if G = M11(0, 0).

生成讲解博客的中文版本

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