On Skolem odd and even difference mean graphs
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)-...
Main Authors: | Gee-Choon Lau, P. Jeyanthi, D. Ramya, R. Kalaiyarasi |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2018-04-01
|
Series: | Journal of King Saud University: Science |
Online Access: | http://www.sciencedirect.com/science/article/pii/S1018364717301787 |
Similar Items
-
On the Skolem problem and the Skolem conjecture
by: Lipton, RJ, et al.
Published: (2022) -
Skolem Number of Cycles and Grid Graphs
by: Braxton Carrigan, et al.
Published: (2021-08-01) -
Even-Odd Prime Harmonious Graphs
by: Dr R. S. Ramkumar
Published: (2022-07-01) -
Skolem meets Schanuel
by: Bilu, Y, et al.
Published: (2022) -
Odd Harmonious Labeling of Some Classes of Graphs
by: P. Jeyanthi, et al.
Published: (2020-12-01)