Mean Labeling of Graphs Associated with Paths and Cycles

Abstract

In mean labeling, unique integer labels are assigned to the vertices such that the each edge receives a distinct label equal to the ceiling of the arithmetic mean of the labels of its incident vertices. In this paper, we prove that the tortoise graph, $PC_n$ graph, $k$-triangular snake graph, and alternate $k$-triangular snake graph admit mean labeling.