Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4650068 | Discrete Mathematics | 2009 | 13 Pages |
Abstract
In contrast, in this paper we show that there are triple-loop networks with an arbitrarily big number of associated minimum distance diagrams. For doing this, we build-up on the relations between minimum distance diagrams and monomial ideals.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Pilar Sabariego, Francisco Santos,