Skolem mean like labeling
Authors: Shainy Shendra V., Balaji V.
Keywords: skolem mean like labeling; skolem mean like graph; path and star
Abstract:
Let G = (V,E) be a graph of order p and size q. A graph G is said to be a skolem mean like graph if p = q+1. Here we prove the theorems to study the characterization for path and star. We prove that the path Pa = p1 ۸ p2 ۸ … ۸ Pb with b-1 wedges is a skolem mean like graph and if a ≥ 4, K1;a is not a skolem mean like graph. Also we prove that the two star K1,a ۸ K1,b is not a skolem mean like graph if and only if |α – b| ≤ 4.