background: various frequencies of sperm aneuploidy are reported in sperms of subfertile patients compared to normal individuals. moreover, sperm dna damage is shown to be associated with male infertility. in this study, the rate of dna damage and frequencies of aneuploidy in sperms of subfertile patients was investigated. methods: semen samples were obtained from healthy normal and subfertile ...

We construct a 1-factorization of the complement Σm of the linear Hamming code of length m = mr = 2 r − 1 in the m-cube Qm, for r ≥ 2, having the following equitable property: its component 1-factors intersect each Cayley parallel 1-factor of Qm at a constant number of edges, (namely 2r edges). In the way to that construction, we find an equitable mr−1-factorization of Σm formed by two factors ...

In this note, we give a complete solution of the existence of orthogonal generalized equitable rectangles, which was raised as an open problem in [4].

0

One of the psychological variables which may have a long-lasting effect on our life is labeling, and students’ accomplishments might be severely undermined through the teacher’s labeling. In spite of this issue, few studies have been carried out on the ramifications of labeling in the educational contexts, in general, and EFL classrooms, in particular. The current study is an attempt to investi...

background: the purpose of study was to evaluate and compare chemical quality of iranian bottled drinking water reported on manufacturer's labeling and standards. methods: this study was a cross-sectional descriptive study and done during july to december 2008. the bottled mineral water collected from shops randomly were analyzed for all parameters address on manufacturer's labeling and the res...

let g=(v,e) be a simple graph. an edge labeling f:e to {0,1} induces a vertex labeling f^+:v to z_2 defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$, where z_2={0,1} is the additive group of order 2. for $iin{0,1}$, let e_f(i)=|f^{-1}(i)| and v_f(i)=|(f^+)^{-1}(i)|. a labeling f is called edge-friendly if $|e_f(1)-e_f(0)|le 1$. i_f(g)=v_f(1)-v_f(0) is called the edge-f...

In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$.  For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...