| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647456 | Discrete Mathematics | 2013 | 6 Pages |
Abstract
A graph G is called degree-magic if it admits a labelling of the edges by integers 1,2,â¦,|E(G)| such that the sum of the labels of the edges incident with any vertex v is equal to 1+|E(G)|2deg(v). Degree-magic graphs extend supermagic regular graphs. In this paper we present a construction of some degree-magic complements of bipartite graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
L'udmila Bezegová,