On a-vertex consecutive edge bimagic labeling for switching graphs

A bijective function f: V ∪ E → {1, 2, …, n+e} is called a-vertex consecutive edge magic total labeling of G, if f(u) + f(uv) + f(v) = k for each edge e∈E and f(V) = {a+1, a+2, …, a+ n} for some a, 0 ≤ a ≤ e. It is said to be a-vertex consecutive edge bimagic total labeling, if the above sum is either k1 or k2. In this paper, we investigate a-vertex consecutive edge bimagic labeling for the switching of P (n ≥ 3) n , C (n ≥ 4) n , p + (n ≥ 2), n C+ (n ≥ 3), n ( 2) 2 1 P + nK n ≥ , ( , 2), , B n m ≥ n m P2 (n ≥ 4) n and C2 (n ≥ 6) n graphs.