Abstract: For a -graph G, a bijective function is a vertex magic total
labeling of G if there exists a
constant c such that for every vertex x,
where the sum runs over all
vertices y adjacent to x.
A vertex magic total labelingf
is called super vertex magic total labeling of G
if [2, 3]. A vertex magic total
labeling f is called superior vertex
magic total labeling of G if A graph G is called reverse vertex magic total labeling if there exists a
bijection such that where the sum runs over all
vertices y adjacent to x.
A reverse vertex magic total labeling is called reverse super vertex magic total
labeling if and a reverse vertex magic
total labeling is called reverse superior vertex magic total labeling if These concepts are introduced
in this paper. In this paper, we prove that flower snark and related graphs are
superior vertex magic, reverse super vertex magic and reverse superior vertex
magic.
Keywords and phrases: flower snark, super vertex magic total labeling, superior vertex magic total labeling, reverse super vertex magic total labeling and reverse superior vertex magic total labeling.
