G(A, B)-Labeling of Cacti over Groups

摘要

Let G be a group with nonempty subsets A and B. The graph G(A, B) is the simple graph obtained by deleting all loops from the graph whose vertex set is A and where vertices x and y are adjacent if and only if there is a b ∈ B such that xb = y or yb = x. In this paper, we present realizations of some cacti as G(A, B)'s.