نتایج جستجو برای: آمارهی کای دو 2 χ
تعداد نتایج: 2747875 فیلتر نتایج به سال:
Optical metasurfaces, i.e. arrays of nanoantennas with sub-wavelength size and separation, enable the manipulation light-matter interactions in miniaturized optical components no classical counterparts. Six decades after first observation second harmonic generation (SHG) bulk crystals, these devices are expected to break new ground field nonlinear optics, shifting focus from phase matching appr...
The aim of the present study was to perform accurate prognosis different molecular types breast cancer (BC) by using partitioning calculation method Ki‑67 index. Partitioning used judge index and type classified according 2019 Chinese Society Clinical Oncology guidelines in 199 cases BC. association between overall survival (OS), disease‑free (DFS) analyzed Chi‑squared test. Survival analysis p...
Objective: To evaluate the performance of three scores, Pediatric Index Mortality 3 (PIM-3), Logistic Organ Dysfunction 2 (PELOD-2), and modified PELOD-2 in predicting mortality multiple organ dysfunction syndrome (MODS) children Vietnam.Material Methods: This cross-sectional study MODS admitted to pediatric intensive care unit (PICU) a central children’s hospital Mekong Delta, Vietnam, was und...
We refine the interpolation property of the {∧,∨,¬}-fragment of classical propositional logic, showing that if 2 ¬φ, 2 ψ and φ ψ then there is an interpolant χ, constructed using at most atomic formulas occurring in both φ and ψ and negation, conjunction and disjunction, such that (i) φ entails χ in Kleene’s strong three-valued logic and (ii) χ entails ψ in Priest’s Logic of Paradox.
Snarks are bridgeless cubic graphs with chromatic index χ = 4. A snark G is called critical if χ(G − {v, w}) = 3, for any two adjacent vertices v and w. For any k ≥ 2 we construct cyclically 5-edge connected critical snarks G having an independent set I of at least k vertices such that χ(G − I) = 4. For k = 2 this solves a problem of Nedela and Škoviera [6].
Let χ(G) denote the chromatic number of the square of a maximal outerplanar graph G and Q denote a maximal outerplanar graph obtained by adding three chords y1y3, y3y5, y5y1 to a 6-cycle y1y2 · · · y6y1. In this paper, it is proved that ∆+1 ≤ χ(G ) ≤ ∆+2, and χ(G) = ∆ + 2 if and only if G is Q, where ∆ represents the maximum degree of G.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید