نتایج جستجو برای: connectivity and tenacity
تعداد نتایج: 16836055 فیلتر نتایج به سال:
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 thermal reaction norms of 4 closely related intertidal Nacellid limpets, Antarctic (Nacella concinna), New Zealand (Cellana ornata), Australia (C. tramoserica) and Singapore (C. radiata), were compared across environments with different temperature magnitude, variability and predictability, to test their relative vulnerability to different scales of climate warming. Lethal limits were measu...
The Ehrenfeucht-Fraisse game is a two-person game of perfect information which is connected to the Zero-One Laws of first order logic. We give bounds for roughly how quickly the Zero-One Laws converge for random bit strings and random circular bit sequences. We measure the tenaciousness of the second player (“Duplicator”) in playing the EhrenfeuchtFraisse game, by bounding the numbers of moves ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید