Mean labelings of cyclic snakes

Abstract

A vertex labeling of a graph G is an assignment f of labels to the vertices of G that induces a label for each edge uv depending on the vertex labels. A vertex labeling that assigns for each edge uv the label is called a mean vertex labeling. A mean labeling f is an injection from V to the set {0, 1, 2, …, q} such that the set of edge labels is {1, 2, …, q}. In this paper we present mean labeling of kCn-snakes, generalized kCn-snakes, and super subdivisions of cycles.