نتایج جستجو برای: maximal degree
تعداد نتایج: 381935 فیلتر نتایج به سال:
We prove that there is no maximal low d.c.e degree.
In this paper we study the Mori fan of Dolgachev-Nikulin-Voisin family in degree $2$ as well associated secondary fan. The main result is an enumeration all maximal dimensional cones two fans.
A graph is k-degenerate if its vertices can be successively deleted so that when deleted, each has degree at most k. These graphs were introduced by Lick and White in 1970 and have been studied in several subsequent papers. We present sharp bounds on the diameter of maximal k-degenerate graphs and characterize the extremal graphs for the upper bound. We present a simple characterization of the ...
Let $$S=K[x_1,\ldots ,x_n]$$ , where K is a field, and $$t_i$$ denotes the maximal shift in minimal graded free S-resolution of algebra S/I at degree i. In this paper, we prove:
We do computational studies concerning the enumeration of isolated cliques in graphs. Isolation, as recently introduced, measures the degree of connectedness of the cliques to the rest of the graph. Isolation helps both in getting faster algorithms than for the enumeration of maximal general cliques and in filtering out cliques with special semantics. We compare three isolation concepts and the...
BACKGROUND Mean or maximal intima-media thickness (IMT) is commonly used as surrogate endpoint in intervention studies. However, the effect of normalization by surrounding or median IMT or by diameter is unknown. In addition, it is unclear whether IMT inhomogeneity is a useful predictor beyond common wall parameters like maximal wall thickness, either absolute or normalized to IMT or lumen size...
We show how to extend any finite probability space into another one which satisfies the conditional construal of for original propositions, given some maximal allowed degree nesting conditional. This mitigates force well-known triviality results.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید