Labeled versus unlabeled distributed Cayley networks (Q1917232)

The authors consider Cayley graphs with the following natural labeling: the label of the edge \((u, v)\) is \(u^{- 1} v\). An anonymous Cayley network is a Cayley graph whose nodes are anonymous. In this paper, the labeling problem on anonymous Cayley networks is studied. In general, oriented Cayley networks can compute more Boolean functions than unoriented Cayley networks. Sufficient conditions for the labeling to be strong are provided. For abelian groups with canonical sets of generators a characterization of groups with strong labelings is given.