New Methods for Magic Total Labelings of Graphs

A \textit{vertex magic total (VMT) labeling} of a graph $G=(V,E)$ is a bijection from the set of vertices and edges to the set of numbers defined by $\lambda:V\cup E\rightarrow\{1,2,\dots,|V|+|E|\}$ so that for every $x \in V$ and some integer $k$, w(x)=\lambda(x)+\sum_{y:xy\in E}\lambda(xy)=k. An \textit{edge magic total (EMT) labeling} is a bijection from the set of vertices and edges to the set of numbers defined by $\lambda:V\cup E\rightarrow\{1,2,\dots,|V|+|E|\}$ so that for every $xy \in E$ and some integer $k$, $w(xy)=\lambda(x)+\lambda(y)+\lambda(xy)=k$. Numerous results on labelings of many families of graphs have been published. In this thesis, we include methods that expand known VMT/EMT labelings into VMT/EMT labelings of some new families of graphs, such as unions of cycles, unions of paths, cycles with chords, tadpole graphs, braid graphs, triangular belts, wheels, fans, friendships, and more.

Author dc:creator

• Singgih, Inne

• Edge Magic Total Labeling
• Kotzig array
• Vertex Magic Total Labeling

Language dc:language.iso

en

Handle dc:identifier.uri

http://hdl.handle.net/11299/191213

OAI identifier oai:identifier

oai:conservancy.umn.edu:11299/191213