On rainbow caterpillars in elementary p-groups

Abstract

Given a finite Abelian group (A,+), consider a tree T with |A| vertices. The labeling f V (T) → A of the vertices of some graph G induces an edge labeling in G, thus the edge uv receives the label f (u) + f (v). The tree T is A-rainbow colored if f 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 A-rainbow, when A is an elementary p-group.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…