نتایج جستجو برای: g2

تعداد نتایج: 18487  

Journal: :Eur. J. Comb. 1998
Yi Ru Huang Kemin Zhang

The problem of determining Ramsey numbers is known to be very difficult. The few known exact values and several bounds for different G1, G2 or m, n are scattered among many technical papers (see [3]). A graph G with order p is called a (G1,G2; p)-graph ((m, n; p)-graph, resp.) if G does not contain a G1 and Ḡ does not contain a G2 (Km and Kn , resp.). It is easy to see that R(G1,G2) = p0 +1 iff...

Journal: :Journal of immunology 2004
Craig D Peacock Raymond M Welsh

CD8+ T cells that coexpress the inhibitory NK cell receptor, Ly49G2 (G2), are present in immunologically naive C57BL/6 mice but display Ags found on memory T cells. To assess how G2+CD8+ cells relate to bona fide memory cells, we examined the origin and fate of lymphocytic choriomeningitis virus (LCMV)-induced G2+CD8+ cells. During early (day 4) acute LCMV infection, both G2+ and G2-CD8+ T cell...

Journal: :Journal of Mathematical Physics 2005

Journal: :Combinatorica 2008
Hemanshu Kaul Alexandr V. Kostochka Gexin Yu

Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets are disjoint. In 1978, Bollobás and Eldridge, and independently Catlin, conjectured that if (∆(G1)+1)(∆(G2)+1)≤ n+1, then G1 and G2 pack. Towards this conjecture, we show that for ∆(G1),∆(G2)≥ 300, if (∆(G1)+1)(∆(G2)+1)≤0.6n+1, then G1 and G2 pack. This is ...

Journal: :Inf. Process. Lett. 2005
Min Xu Junming Xu Xin-Min Hou

The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of G− F for any F ⊂ V (G) with |F | < k. Krishnamoorthy and Krishnamurthy first proposed this concept and gave Dκ(G1)+κ(G2)(G1 ×G2) Dκ(G1)(G1)+ Dκ(G2)(G2) when κ(G1 ×G2)= κ(G1)+ κ(G2), where κ(G) is the connectivity of G. This paper gives a counterexample to this bound and establishes Dk1+k2(G1 × G2) Dk1(G1) +Dk2 ...

Journal: :Discrete Mathematics 2016
Alexandr V. Kostochka Andrew McConvey Derrek Yager

Two graphs G1 and G2, each on n vertices, pack if there exists a bijection f from V (G1) onto V (G2) such that uv ∈ E(G1) only if f (u)f (v) ∉ E(G2). In 2014, Alon and Yuster proved that, for sufficiently large n, if |E(G1)| < n − δ(G2) and ∆(G2) ≤ √ n/200, then G1 and G2 pack. In this paper, we characterize the pairs of graphs for which the theorem of Alon and Yuster is sharp.We also prove the...

Journal: :ABC Imagem Cardiovascular 2022

Background: The combination of doxorubicin (DOX) with paclitaxel (PTX) effectively treats breast cancer (BC). However,DOX-associated cardiotoxicity (CTX) is aggravated by the use PTX. Consensus lacking about which drug sequence involves most CTX. Objectives: To evaluate whether DOX followed PXT or reverse has greatest cardiotoxic potential in treatment BC. Methods: Prospective study women prima...

2011
GORO C. KATO

Let WQ = Proj(Q[g2' g3' X, Y, ZJI(homogeneous ideal generated by y 2Z + 4X3 g2XZ2 g3Z3». This is said to be the Weierstrass Family over the field Q. Then the first homology with compact supports of the Weierstrass Family is computed explicitly, i.e., it is generated by {C-kdX 1\ dYh .. , and {XC-kdX 1\ dYh .. 1 over the ring Q[g2' g3]' where C is a polynomial y 2 4X3 + g2 X + g3' When one tenso...

Journal: :Nuclear Physics B 2002

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه سمنان - دانشکده علوم پایه 1392

در این پایان به خوبی g1(x,q ها بحث خواهیم کرد. خواهیم دید که تابع ساختار اسپینی ( 2 ?? های آن ?? مورد ویژگی در مدل پارتونی توصیف مناسبی وجود ندارد. g2(x,q شود اما برای ( 2 ?? توسط مدل پارتونی توصیف می را به طور کامل g2ww(x,q ی معروف واندزورا-ویلچک معرفی خواهد شد. این رابطه ( 2 ?? در ادامه رابطه ،katao ی فرترن نوشته شده توسط گروه ?? نماید. سپساز کد برنامه ?? توصیفمی g1(x,q بر حسب ( 2 را به ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید