加载中…
Given a finite Abelian group , consider a tree with vertices. The labeling of the vertices of some graph induces an edge labeling in , thus the edge receives the label . The tree is -rainbow colored if is a bijection and edges have different colors. In this paper, we give necessary and sufficient conditions for a caterpillar with three spine vertices to be -rainbow, when is an elementary -group.

生成讲解博客的中文版本

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