| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647673 | Discrete Mathematics | 2013 | 9 Pages |
Abstract
A graph GG is called degree-magic if it admits a labelling of the edges by integers 1,2,…,|E(G)|1,2,…,|E(G)| such that the sum of the labels of the edges incident with any vertex vv is equal to 12(1+|E(G)|)deg(v). Degree-magic graphs extend supermagic regular graphs. In this paper, we present some bounds on the number of edges in degree-magic graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
L’udmila Bezegová, Jaroslav Ivančo,