| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651297 | Discrete Mathematics | 2006 | 7 Pages |
Abstract
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper, we characterize magic circulant graphs and 3-regular supermagic circulant graphs. We establish some conditions for supermagic circulant graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Andrea Semaničová,