We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Mean Labelings on Product Graphs.
- Authors
John, Teena Liza; T. K., Mathew Varkey
- Abstract
Let G be a (p, q) graph and let f : V(G) → {0,1, · · ·, q} be an injection. Then G is said to have a mean labeling if for each edge uv, there exists an induced injective map f * : E(G) → {1, 2, · · ·, q} defined by f*(uv) f(u) + f(v)/2 if f (u) + f (v) is even, and f(u) + f(v) + 1/2 if f (u) + f (v) is odd We extend this notion to Smarandachely near m-mean labeling if for each edge e = uv and an integer m > 2, the induced Smarandachely m-labeling f * is defined by f * (e) = [ f(u) + f(v) + 1/2] A graph that admits a Smarandachely near mean m-labeling is called Smarandachely near m-mean graph. The graph G is said to be a near mean graph if the injective map f : V (G) → {1, 2, ···, q -- 1, q + 1} induces f * : E(G) → {1, 2, ···, q} which is also injective, defined as above. In this paper we investigate the direct product of paths for their meanness and the Cartesian product of Pn and K4 for its near-meanness.
- Subjects
GRAPH labelings; ARITHMETIC mean; SMARANDACHE function; MATHEMATICAL analysis; INTEGERS
- Publication
International Journal of Mathematical Combinatorics, 2014, Vol 3, p97
- ISSN
1937-1055
- Publication type
Article