Non skolem mean labeling of a six star graph

Abstract

A graph G = (V, E) with p vertices and q edges is said to be a Skolem mean graph if there exists a function f from the vertex set of G to {1, 2, 3, …, p} such that the induced map f * from the edge set of G to {2, 3, 4, …, p} defined by f∗(e = uv)= then the resulting edges get distinct labels from the set {2, 3, 4, …, p}.In this paper we prove that the six star graph G = 5K1,2