Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
7216608 | Journal of King Saud University - Science | 2018 | 6 Pages |
Abstract
Let G=(V,E) be a simple, finite and undirected (p,q)-graph with p vertices and q edges. A graph G is Skolem odd difference mean if there exists an injection f:V(G)â{0,1,2,â¦,p+3q-3} and an induced bijection fâ:E(G)â{1,3,5,â¦,2q-1} such that each edge uv (with f(u)>f(v)) is labeled with fâ(uv)=f(u)-f(v)2. We say G is Skolem even difference mean if there exists an injection f:V(G)â{0,1,2,â¦,p+3q-1} and an induced bijection fâ:E(G)â{2,4,6,â¦,2q} such that each edge uv (with f(u)>f(v)) is labeled with fâ(uv)=f(u)-f(v)2. A graph that admits a Skolem odd (or even) difference mean labeling is called a Skolem odd (or even) difference mean graph. In this paper, first, we construct some new Skolem odd difference mean graphs and then investigate the Skolem even difference meanness of some standard graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Chemistry
Chemistry (General)
Authors
Gee-Choon Lau, P. Jeyanthi, D. Ramya, R. Kalaiyarasi,