نتایج جستجو برای: semi total line graph
تعداد نتایج: 1484721 فیلتر نتایج به سال:
abstract background: a major problem of the first moments of childbirth, especially in “prolonged labor,” is perinatal asphyxia which necessitates neonatal resuscitation. this study aimed at evaluating the alert line of the partogram in recognizing the need for neonatal resuscitation 20–30 s after delivery. materials and methods: 140 full‑term pregnant women were kept under surveillance through...
a dissolved methane sensor based on silicone tube was designed, constructed and optimized.the silicone tube diameter, silicone tube length and helium flow rate (as the carrier gas(were considered as process parameters to be optimized.a continuous stream of helium (50 ml/min) was directed through the tubing, sweeping out the dissolved methane which diffused through the walls of the tubing from t...
We consider the semi-on-line parallel machines scheduling problem with the known total and the largest processing times of all jobs. We develop an approximation algorithm for the problem and prove that the competitive ratio of the algorithm is not more than √ 10 3 ≈ 1.8257, regardless of the number of machines.
We show that a nite graph that is the inverse limit with a single surjective upper semi-continuous set valued function f : [0, 1] → 2[0,1] is either an arc or a simple triod. It is not known if there is such a simple triod.
a total dominating set of a graph $g$ is a set $d$ of vertices of $g$ such that every vertex of $g$ has a neighbor in $d$. the total domination number of a graph $g$, denoted by $gamma_t(g)$, is~the minimum cardinality of a total dominating set of $g$. chellali and haynes [total and paired-domination numbers of a tree, akce international ournal of graphs and combinatorics 1 (2004), 6...
The total angular resolution of a straight-line drawing is the minimum angle between two edges drawing. It combines properties contributing to readability drawing: resolution, which incident edges, and crossing edges. We consider graph, maximum this graph. prove that, up finite number well specified exceptions constant size, graph with $n$ vertices greater than $60^{\circ}$ bounded by $2n-6$. T...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید