| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649714 | Discrete Mathematics | 2008 | 4 Pages |
Abstract
A wheel is a graph consisting from a vertex w and a circuit C such that each vertex of C is a neighbor of w. Two nowhere-zero group valued flows on a wheel are equivalent if their values differ only on the edges of C. We introduce recursive formulas for the numbers of classes of the same cardinality of this equivalence.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Martin Kochol, Nad’a Krivoňáková, Silvia Smejová, Katarína Šranková,