Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4653999 | European Journal of Combinatorics | 2011 | 7 Pages |
Abstract
Several groups are associated naturally with acyclic directed graphs and in particular with partially ordered sets. It is investigated when these groups are abelian. Those acyclic directed graphs where the groups are abelian are characterized as in-Eulerian, out-Eulerian, Eulerian and strongly Eulerian. Here strongly Eulerian means that for any two elements the parity of their common out-neighbors is equal to the parity of their common in-neighbors. We also give an upper bound for the order of the mod 2 raising operator which is the most prominent generator of the groups.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Thomas Bier, Imed Zaguia,