Oblong Mean Prime Labeling of Some Snake Graphs

Abstract

A graph labeling is an assignment of integers to the vertices or edges or both subject to certain conditions. The graph for which every edge(uv),the labels assigned to u and v are oblong numbers and for each vertex of degree at least 2, the g c d of the labels of the incident edges is 1. Here we characterize some snake graphs for oblong mean prime labeling.