the research aims at studying the effects of mycorrhizal fungi (glomus fasciculatum, g. mosseae and mixed composition) on growth, photosynthesis and nutrient absorption of ziziphus spina-christi in mehran greenhouse, ilam province. the result showed that colonization rate in mixed treatment was more than pure treatment of g. fasciculatum and g. mosseae. also, root fresh weight, stomatal conduct...

We investigate the effect of speech coding on automatic speaker recognition when training and testing conditions are matched and mismatched. Experiments use standard speech coding algorithms (GSM, G.729, G.723, MELP) and a speaker recognition system based on Gaussian mixture models adapted from a universal background model. There is little loss in recognition performance for toll quality speech...

an h-magic labeling in a h-decomposable graph g is a bijection f : v (g) ∪ e(g) → {1, 2, ..., p + q} such that for every copy h in the decomposition, σνεv(h) f(v) +  σeεe(h) f(e) is constant. f is said to be h-e-super magic if f(e(g)) = {1, 2, · · · , q}. a family of subgraphs h1,h2, · · · ,hh of g is a mixed cycle-decomposition of g if every subgraph hi is isomorphic to some cycle ck, for k ≥ ...

An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) +  ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...

An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ∑νεV (H) f(v) + ∑νεE (H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥...

‎‎Let $G=(V‎, ‎E)$ be a simple graph with vertex set $V$ and edge set $E$‎. ‎A {em mixed Roman dominating function} (MRDF) of $G$ is a function $f:Vcup Erightarrow {0,1,2}$ satisfying the condition that every element $xin Vcup E$ for which $f(x)=0$ is adjacent‎‎or incident to at least one element $yin Vcup E$ for which $f(y)=2$‎. ‎The weight of an‎‎MRDF $f$ is $sum _{xin Vcup E} f(x)$‎. ‎The mi...

this study was performed for evaluation of the qualitative traits of safflower (carthamus tinctorius l.) as affected by azotobacter and mycorrhizal symbiosis (host plant root symbiosis with the glomus fungi) as factorial experiment based on randomized complete block design with three replications in research farm of college of arak islamic azad university during growing season of 2011-2012. tre...

A mixed dominating set S of a graph G = (V,E) is a subset S ⊆ V ∪ E such that each element v ∈ (V ∪ E) \ S is adjacent or incident to at least one element in S. The mixed domination number γm(G) of a graph G is the minimum cardinality among all mixed dominating sets in G. The problem of finding γm(G) is know to be NP-complete. In this paper, we present an explicit polynomial-time algorithm to c...