Title of article
k-Odd mean labeling of prism
Author/Authors
-، - نويسنده Periyar E.V.R. College(Autonomous) Gayathri, B. , -، - نويسنده Roever Engineering College Amuthavalli, K.
Issue Information
فصلنامه با شماره پیاپی 0 سال 2015
Pages
8
From page
49
To page
56
Abstract
-
Abstract
A $(p,q)$ graph $G$ is said to have a $k$-odd mean
labeling $(k ge 1)$ if there exists an injection $f : V
to {0, 1, 2, ldots, 2k + 2q - 3}$ such that the
induced map $f^*$ defined on $E$ by $f^*(uv) =
leftlceil frac{f(u)+f(v)}{2}rightrceil$ is a
bijection from $E$ to ${2k - 1, 2k + 1, 2k + 3, ldots, 2
k + 2q - 3}$. A graph that admits $k$-odd mean
labeling is called $k$-odd mean graph. In this paper,
we investigate $k$-odd mean labeling of prism $C_m times P_n$.
Journal title
Transactions on Combinatorics
Serial Year
2015
Journal title
Transactions on Combinatorics
Record number
2337324
Link To Document