Year: 2015
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: da Costa, G. A. T. F, Policarpo, M.
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1834513021