let $g$ be a $p$-group of nilpotency class $k$ with finite exponent $exp(g)$ and let $m=lfloorlog_pk floor$. we show that $exp(m^{(c)}(g))$ divides $exp(g)p^{m(k-1)}$, for all $cgeq1$, where $m^{(c)}(g)$ denotes the c-nilpotent multiplier of $g$. this implies that $exp( m(g))$ divides $exp(g)$, for all finite $p$-groups of class at most $p-1$. moreover, we show that our result is an improvement...

Let G be a (p,q) graph and A be a group. We denote the order of an element $a in A $ by $o(a).$  Let $ f:V(G)rightarrow A$ be a function. For each edge $uv$ assign the label 1 if $(o(f(u)),o(f(v)))=1 $or $0$ otherwise. $f$ is called a group A Cordial labeling if $|v_f(a)-v_f(b)| leq 1$ and $|e_f(0)- e_f(1)|leq 1$, where $v_f(x)$ and $e_f(n)$ respectively denote the number of vertices labelled w...

let g be a (p, q) graph. let k be an integer with 2 ≤ k ≤ p and f from v (g) to the set {1, 2, . . . , k} be a map. for each edge uv, assign the label |f(u) − f(v)|. the function f is called a k-difference cordial labeling of g if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively den...

G3: Genes|Genomes|Genetics has removed 10.1534/g3.114.012203 from early online publication. The early online version of the article was published in error and is instead published early online at GENETICS as 10.1534/genetics.114.169268 at http://www.genetics.org/content/early/2014/07/24/genetics.114.169268, and the version of record will be published in the GENETICS October 2014 issue. The jour...

The polarizabilities of the pion have been predicted in several different theoretical frameworks. The status of these is reviewed.

let g be a (p, q) graph. let f : v (g) → {1, 2, . . . , k} be a map. for each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of g if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....