background and aims: herpes simplex virus (hsv) is a common cause of corneal disease and is the leading infectious cause of corneal blindness among developed nations. this study is aimed to provide an estimation of the incidence of herpes simplex virustype-1, 2(hsv1, 2) and varicella zoster virus (vzv) in tears and swab from eye infection by polymerase chain reaction (pcr) in eye disease in a s...

For the terminology and notations not defined here, we adopt those in Bondy and Murty [1] and Xu [2] and consider simple graphs only. Let G = (V,E) be a graph with vertex set V = V (G) and edge set E = E(G). For any vertex v ∈ V , NG(v) denotes the open neighborhood of v in G and NG[v] = NG(v) ∪ {v} the closed one. dG(v) = |NG(v)| is called the degree of v in G, ∆ and δ denote the maximum degre...

• A graph G is an ordered pair (V,E) consisting of a set V of vertices and a set E (disjoint from V ) of edges, together with an incidence function End : E → M2(V ), where M2(V ) is set of all 2-element sub-multisets of V . We usually write V = V (G), E = E(G), and End = EndG. • If e is an edge and u, v are vertices such that End(e) = {u, v}, we say that e joins u and v, or, u and v are inciden...

0.1 Maximum Flow Problem:[CLRS] INPUT: A directed simple graph G = [V ;E] with positive edge capacities c(e); e ∈ E and two distinguished nodes s, t ∈ V . Definition 1 A feasible flow is a function f : E → R+ that satisfies: ∑ v∈V (u,v)∈E f(u, v)− ∑ v∈V (v,u)∈E f(v, u) =    F 0 −F u = s u = s, t u = t 0 ≤ f(u, v) ≤ c(u, v) ∀(u, v) ∈ E We want a feasible flow that maximizes F . Definition 2 A...

Background & Aim: Eucalyptus L'Her. [an aromatic genera of the family (Myrtaceae)] is native to Australia and other tropical species is planted worldwide. The purpose of this study is to extract and identify the essential oils components of four species of Eucalyptus L'Her. cultivated in botanical garden of Kashan, Central Iran. Experimental: Leaves of E. largiflorens</em...

For any integer  ‎, ‎a minus  k-dominating function is a‎function  f‎ : ‎V (G)  {-1,0‎, ‎1} satisfying w) for every  vertex v, ‎where N(v) ={u V(G) | uv  E(G)}  and N[v] =N(v)cup {v}. ‎The minimum of ‎the values of  v)‎, ‎taken over all minus‎k-dominating functions f,‎ is called the minus k-domination‎number and is denoted by $gamma_k^-(G)$ ‎. ‎In this paper‎, ‎we ‎introduce the study of minu...

‎‎let $g=(v,e)$ be a simple graph‎. ‎an edge labeling $f:eto {0,1}$ induces a vertex labeling $f^+:vtoz_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(...