Enumeration of balanced finite group valued functions on directed graphs
Combinatorics
2014-05-16 v1
Abstract
A group valued function on a graph is called balanced if the product of its values along any cycle is equal to the identity element of the group. We compute the number of balanced functions from edges and vertices of a directed graph to a finite group.
Keywords
Cite
@article{arxiv.1405.3686,
title = {Enumeration of balanced finite group valued functions on directed graphs},
author = {Yonah Cherniavsky and Avraham Goldstein and Vadim E. Levit and Robert Shwartz},
journal= {arXiv preprint arXiv:1405.3686},
year = {2014}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1303.5456