Totally magic graphs
Document Type
Article
Publication Date
6-10-2002
Abstract
A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the vertices and edges onto the integers 1,2,...,v + e. Such a labeling is vertex magic if the sum of the label on a vertex and the labels on its incident edges is a constant independent of the choice of vertex, and edge magic if the sum of an edge label and the labels of the endpoints of the edge is constant. In this paper we examine graphs possessing a labeling that is simultaneously vertex magic and edge magic. Such graphs appear to be rare. © 2002 Elsevier Science B.V. All rights reserved.
Publication Title
Discrete Mathematics
Recommended Citation
Exoo, G.,
Ling, A.,
McSorley, J.,
Phillips, N.,
&
Wallis, W.
(2002).
Totally magic graphs.
Discrete Mathematics,
254(1-3), 103-113.
http://doi.org/10.1016/S0012-365X(01)00367-3
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/7262