A characterization of complete tripartite degree-magic graphs

L’udmila Bezegová, Jaroslav Ivančo

Discussiones Mathematicae Graph Theory · 2012 · 10 citations · 7 references

DOIFull text

Open access

Concepts

Abstract

A graph 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)| 2 deg(v). Degree-magic graphs extend supermagic regular graphs. In this paper we characterize complete tripartite degree-magic graphs.

References

7