Flower snark and related graph’s reverse super edge – Magic labelings
U. Masthan Raju, Shaik Sharief Basha · AIP conference proceedings · 2019
A unlooped G(V,E) graph is known as reverse super vertex-magic labelings if it has a mapping bijection f from vertices & edges of the graph G to number which are natural from the numbers 1,2,3, …, |V(G)| + |E(G)| such that g(v) − ∑ g(uv) = k everywhere the summation is occupied for all vertices u which is adjacent to another v and g(V(G) = {1,2,3, … |V(G)|}, g(E(G) = {|V(G| + 1, |V(G| + 2, …, |V(G| + |E(G)|}. For odd integer n is greater than or equal to 5, the flower snark Fn(V,E) is completely undirected simple cubic graph having 4n vertices, such that V = {bi:0 ≤ i ≤ n − 1 } ∪ { ci:0 ≤ i ≤ − 1} ∪{ai: 0 ≤ i ≤ − 1} and E = {bib(i + 1)madn : 0 ≤ i ≤ − 1} ∪ {ci c(i+1)mad 2n: 0 ≤ i ≤ 2n −1} ∪ {aibi, ai ci, ai cn+1, aibi,: 0 ≤ i ≤ n −1}. Therefore, For n = 3 or even n ≥ 4, Fn is known as the flower snark’s related graph. Now here in paper, we verified as the flower snark and its graphs related are reverse super magic vertex.