Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4649822 | Discrete Mathematics | 2009 | 6 Pages |
Abstract
We derive an upper bound on the number of vertices in regular graphs of given degree and diameter arising as regular coverings of dipoles over abelian groups.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Eyal Loz,