2,267 research outputs found
H-E-Super Magic Decomposition of Graphs
An H-magic labeling in an H-decomposable graph G is a bijection f:V(G) U E(G) --> {1,2, β¦ ,p+q} such that for every copy H in the decomposition, is constant. The function f is said to be H-E-super magic if f(E(G)) = {1,2, β¦ ,q}. In this paper, we study some basic properties of m-factor-E-super magic labelingand we provide a necessary and sufficient condition for an even regular graph to be 2-factor-E-super magic decomposable. For this purpose, we use Petersen\u27s theorem and magic squares
New Methods for Magic Total Labelings of Graphs
University of Minnesota M.S. thesis. May 2015. Major: Mathematics. Advisors: Dalibor Froncek, Sylwia Cichacz-Przenioslo. 1 computer file (PDF); ix, 117 pages.A \textit{vertex magic total (VMT) labeling} of a graph is a bijection from the set of vertices and edges to the set of numbers defined by so that for every and some integer , . An \textit{edge magic total (EMT) labeling} is a bijection from the set of vertices and edges to the set of numbers defined by so that for every and some integer , . 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
- β¦