Article Title

Vertex Magic


This paper addresses labeling graphs in such a way that the sum of the vertex labels and incident edge labels are the same for every vertex. Bounds on this so-called magic number are found for cycle graphs. If a graph has an odd number of vertices, algorithms can be found to produce different magic-vertex graphs with the maximum and minimum magic number. Also, every cycle graph with an odd number of vertices can be made into a vertexmagic graph if the odd numbers or even numbers are placed on the vertices. Some interesting problems arise when one begins to look at cycle graphs with an even number of vertices. Bounds for the magic number change, and it becomes harder to make these graphs vertex-magic. We have shown some algorithms for finding vertex-magic cycle graphs with a magic number that lies within the bounds.

Faculty Advisor Name

Crista Coles

Faculty Advisor Institution

Elon University

Suggested Mathematics Subject Classification(s)



This paper was written while the author was an undergraduate at Elon University.

Included in

Mathematics Commons



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.