Title of article
Counting nowhere-zero flows on wheels
Author/Authors
Martin Kochol، نويسنده , , Nad’a Krivo??kov?، نويسنده , , Silvia Smejov?، نويسنده , , Katar?na ?rankov?، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
4
From page
2050
To page
2053
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.
Keywords
n-Wheel , Nowhere-zero A-flow , Simple network
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947290
Link To Document