نتایج جستجو برای: tenacity
تعداد نتایج: 646 فیلتر نتایج به سال:
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
The aim of this study was to evaluate the effectiveness of the therapy on the passion and tenacity of study in secondary school students was the second city of Khorramabad. This quasi-experimental study in which pretest - posttest control group design was used. The sample consisted of 40 subjects among male high school students of Khorramabad were selected and randomly assigned to experimental ...
the analysis of vulnerability in networks generally involves some questions about how the underlying graph is connected. one is naturally interested in studying the types of disruption in the network that maybe caused by failures of certain links or nodes. in terms of a graph, the concept of connectedness is used in di erent forms to study many of the measures of vulnerability. when certain ver...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید