Let r(G,H) be the smallest integer N such that for any 2-coloring (say, red and blue) of the edges of Kn, n > N there is either a red copy of G or a blue copy of H . Let Kn − K1,s be the complete graph on n vertices from which the edges of K1,s are dropped. In this note we present exact values for r(Km −K1,1,Kn −K1,s) and new upper bounds for r(Km,Kn−K1,s) in numerous cases. We also present som...

The double star S(n, m), where n * m a 0, is the graph cons isting of the union of two stars &I and &n together with a line joining their centers. Its rsmsey number r(S(n, m)) is the least number p such that there is a monochromatic copy of S(n, m) in any 2-coloring of the edges of Kpa It is shown that r(S(n, m)) = max (2n + 1, n + 2m + 2) if n is odd and m G 2; and r(S(n, m)) = max (2n + 2, n ...

A proper edge coloring of a simple graph G is called a vertex distinguishing edge coloring (vdec) if for any two distinct vertices u and v of G, the set of the colors assigned to the edges incident to u differs from the set of the colors assigned to the edges incident to v. The minimum number of colors required for all vdecs of G is denoted by χ ′ s (G) called the vdec chromatic number of G. Le...

this study was conducted to determine water stress tolerance of two iranian dudaim melons (kerman & birjand) and one iranian muskmelon (samsoury). throughout the experiment, three different levels of irrigation with three irrigation starting points (-50, -65 and -75 cb of matric potential) were employed. results indicated that water stress significantly affected yield, firmness, fruit sugars as...

o r g a n i z a t i o n s i n a s u p p l y c h a i n a r e i n d e p e n d e n t e n t i t i e s. a l t h o u g h a c o m p l e t e l y i n t e g r a t e d s o l u t i o n m a y r e s u l t i n o p t i m a l s y s t e m p e r f o r m a n c e, s u p p l y c h a i n m e m b e r s a r e i n t e r e s t e d i n o p t i m i z i n g t h e i r o w n o b j e c t i v e r a t h e r t h a n t h a t o f t...

Let F ,G be families of graphs. The generalized Ramsey number r(F ,G) denotes the smallest value of n for which every red-blue coloring of Kn yields a red F ∈ F or a blue G ∈ G. Let F(k) be a family of graphs with k vertex-disjoint cycles. In this paper, we deal with the case where F = F(3),G = {Kt} for some fixed t with t > 2, and prove that r(F(3),G) = 2t + 5.

background: interleukin-6 (il-6) is one of the inflammatory mediators characterized by elevated levels in ischemic stroke (is) patients. the present study set out to assess the role of il-6, as a marker for inflammation, in the severity and prognosis of acute is. methods: in a cross-sectional descriptive study, 45 patients with acute is were selected. patients with their first day of stroke wer...

Let T be a tree with no degree 2 vertices and L(T) = {l1,. .. , lr}, r ≥ 2 denote the set of leaves in T. An Halin graph G is a graph obtained from T such that V (G) = V (T) and E(G) = E(T) ∪ {{li, li+1} | 1 ≤ i ≤ r − 1} ∪ {l1, lr}. In this paper, we investigate combinatorial problems such as, testing whether a given graph is Halin or not, chromatic bounds, an algorithm to color Halin graphs wi...

We say a s-uniform r-partite hypergraph is complete, if it has a vertex partition {V1, V2, . . . , Vr} of r classes and its hyperedge set consists of all the s-subsets of its vertex set which have at most one vertex in each vertex class. We denote the complete s-uniform r-partite hypergraph with k vertices in each vertex class by Ts,r(k). In this paper we prove that if h, r and s are positive i...