Counting covering cycles
Combinatorics
2015-10-30 v1
Abstract
We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the number of Euler cycles in the non oriented graph. An identity relating the numbers of covering cycles of any length in a graph to a product of determinants is obtained.
Keywords
Cite
@article{arxiv.1510.08777,
title = {Counting covering cycles},
author = {G. A. T. F da Costa and M. Policarpo},
journal= {arXiv preprint arXiv:1510.08777},
year = {2015}
}
Comments
7 pages