SKOLEM MINKOWSKI-4 MEAN LABELING OF GRAPHS

Abstract

Let be an simple and undirected graph with vertices and edges. Let us define a function is called Skolem Minkowski-4 Mean Labeling of a graph G if we could able to label the vertices with distinct elements from such that it induces an edge labeling

defined as,

⌈ (

)

⌉ is distinct for all edges (i,e.) It indicates that, distinct vertex labeling induces a distinct edge labeling on the graph. The graph which admits Skolem Minkowski-4 Mean Labeling is called a Skolem Minkowski-4 Mean Graph. In this paper, we have investigated the Skolem Minkowski-4 Mean Labeling of some standard graphs like Path, Comb, Caterpillar, , etc.