Linear Cyclic Snakes as Super Vertex Mean Graphs.

A super vertex mean labeling f of a (p, q) - graph G(V,E) is defined as an injection from E to the set {1, 2, 3, ..., p+q} that induces for each vertex v the label defined by the rule fv(v) = Round ..., where Ev denotes the set of edges in G that are incident at the vertex v, such that the set of all edge label and the induced vertex labels is {1, 2, 3, · · ·, p + q}. All the cycles, Cn, n = 3 and n = 4 are super vertex mean graphs. Our attempt in this paper is to show that all the linear cyclic snakes, including kC4, are also super vertex mean graphs, even though C4 is not an SVM graph. We also define the term Super Vertex Mean number of graphs. [ABSTRACT FROM AUTHOR]