نتایج جستجو برای: closed helm graph
تعداد نتایج: 314669 فیلتر نتایج به سال:
the reciprocal degree distance (rdd), defined for a connected graph $g$ as vertex-degree-weighted sum of the reciprocal distances, that is, $rdd(g) =sumlimits_{u,vin v(g)}frac{d_g(u) + d_g(v)}{d_g(u,v)}.$ the reciprocal degree distance is a weight version of the harary index, just as the degree distance is a weight version of the wiener index. in this paper, we present exact formu...
For given closed orientable 3-manifolds M and N let D(M,N) be the set of mapping degrees from M to N . We address the problem: For which N , D(M,N) is finite for all M? The answer is known in Thurston’s picture of closed orientable irreducible 3-manifolds unless the target is a non-trivial graph manifold. We prove that for each closed non-trivial graph manifold N , D(M,N) is finite for all grap...
INTRODUCTION An ACR/EULAR task force released new criteria to classify rheumatoid arthritis at an early stage. This study evaluates the diagnostic performance of these criteria and algorithms by van der Helm and Visser in REACH. METHODS Patients with symptoms ≤12 months from REACH were used. Algorithms were tested on discrimination, calibration and diagnostic accuracy of proposed cut-points. ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید