A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

Classical mean labeling of a graph G with p vertices and q edges is an injective function
from the vertex set of G to the set {1, 2, 3,…, q+ 1} such that the edge labels obtained from …

A graph admits flooring function of centroidal meanness property if its injective node
assignment Λ is from 1 to 1+ q along with bijective link assignment Λ⋆(uv)=⌊ 1/3Γ (u, v)[Λ …

Some Graph Operations Of Even Vertex Odd Mean Labeling Graphs Page 1 International
Journal of Applied Engineering Research ISSN 0973-4562 Volume 12, Number 18 (2017) …

A function f is called an F-geometric mean labeling of a graph G=(V, E) with p vertices and q
edges if f: V→{1, 2, 3,…, q+ 1} is injective and the induced function f*: E→{1, 2, 3,…, q} …

An injective function $ f: V (G)\rightarrow\{0, 1, 2,\dots, q\} $ is an odd sum labeling if the
induced edge labeling $ f^* $ defined by $ f^*(uv)= f (u)+ f (v), $ for all $ uv\in E (G), $ is …

Throughout this paper, by a graph we mean a finite, undirected and simple graph. Let G (V,
E) be a graph with p vertices and q edges. For notations and terminology, we follow [5]. For a …

Consider the graph G, with the injection Ω from node set to the first p+ q natural numbers. Let
us assume that the ceiling function of the classical average of the node labels of the end …

Classical mean labeling of a graph G with p vertices and q edges is an injective function
from the vertex set of G to the set 1, 2, 3,..., q+ 1 {} such that the edge labels obtained from …

A Notion of Even Vertex Odd Mean Labeling Graphs Page 1 International Journal of Mathematics
Trends and Technology (IJMTT) – Volume 50 Number 3 October 2017 ISSN: 2231-5373 …