Báo cáo toán học: "Steiner triple systems and existentially closed graphs" ppsx

... analysis of the capacity of N∗Nakagami-m channels. Specifically, we have studied the influence of the severity of fading and the number of hops on the PDF, CDF, LCR, and ADF of the channel capacity. ... the expressions for the statistical properties of the channel capacity C(t). Again, by applying the concept of transformation of random variables...

Ngày tải lên: 20/06/2014, 20:20

... ) -iteration for finding a fixed point of continu- ous mappings on an arbitrary interval. Then, a necessary and sufficient condition for the strong convergence of the proposed iterative methods for continuous ... and nondecreasing functions. In this article, we are interested to employ the concept of W -mappings and K- mappings for approximation of a sol...

Ngày tải lên: 20/06/2014, 20:20

... was 7 Integrated acoustic echo and background noise suppression technique based on soft decision Yun-Sik Park 1 and Joon-Hyuk Chang ∗2 1 School of Electronic Engineering, Inha University, Incheon ... efficient integrated acoustic echo and noise suppression algorithm using the combined power of acoustic echo and background noise within a soft deci...

Ngày tải lên: 20/06/2014, 20:20

... an acute coronary syndrome, and one of the few cases associated with capsaicin. Capsaicin, a sympathomimetic agent, may be implicated in the initiation of coronary vasospasm and acute myocardial ... that is associated with the inhibition of potassium currents [8,9]. Coronary vasospasm and acute myocardial infarction (AMI) associated wit...

Ngày tải lên: 20/06/2014, 20:20

... properly cited. Overview of principles and implementations to deal with spatial issues in monitoring environmental effects of genetically modified organisms Winfried Schröder †1 and Gunther ... formatted PDF and full text (HTML) versions will be made available soon. Overview of principles and implementations to deal with spatial is...

Ngày tải lên: 20/06/2014, 20:20

... data, and in drafting the manuscript. TG has contributed in acquiring the preclinical data, in analyzing and interpreting this set of data, and in drafting the manuscript. MH has contributed in ... imaging monoamine transporters: dopamine, serotonin, and norepinephrine. PET Clin 2009, 4:101-128. 3. Schou M, Steiger C, Varrone A, Guilloteau D, Halldin C: Synthesis,...

Ngày tải lên: 20/06/2014, 20:20

... class="bi x0 y0 w2 h 3" alt =""

Ngày tải lên: 05/08/2014, 15:20

... line configurations in Steiner triple systems , J. Comb. Des. 3 (1995), 51-59. [10] T.S. Griggs, M.J. de Resmini, and Rosa, A.,“ Decomposing Steiner triple systems into four-line configurations”, ... 229–247. [4] C.J. Colbourn and A. Rosa, Triple Systems, Oxford University Press1999. [5] Chee, Y. M., Colbourn, C. J. and Ling, A. C. H., “Weakly union-free twofold triple systems, ”...

Ngày tải lên: 07/08/2014, 06:20

... then switching of edges in a strongly regular graph may produce another strongly regular graph. If switching of edges in a regular graph produces a regular graph then the corresponding partition ... merging of classes in the scheme of 2-orbits of this action of H. It was clear from the beginning that one of the resulting schemes will give the graph Θ, howev...

Ngày tải lên: 07/08/2014, 07:21

... an n -existentially closed graph is (n − 1) -existentially closed, the theorem is trivially true for v = 7 and 9. There are two non-isomorphic STS(13)s and 80 non- isomorphic STS(15)s, [17], and ... systems and configurations. 2 Steiner triple systems A Steiner triple system of order v, STS(v), is a pair (V, B) where V is a set of cardinality v of elements, or points, and...

Ngày tải lên: 07/08/2014, 13:21

... define oriented arc-colorings of oriented graphs in a natural way by saying that, as in the undirected case, an oriented arc-coloring of an oriented graph G is an oriented vertex-coloring of the ... arcs of A  . Let G be an oriented graph and f be an oriented arc-coloring of G. For a given vertex v of G,wedenotebyC + f (v)andC − f (v) the outgoing color set of...

Ngày tải lên: 07/08/2014, 13:21

... one of the bicliques in B.Thebiclique cover number, bc(G), of a graph G is the minimum number of bicliques in a biclique cover of G.Abiclique partition of a graph G is a collection B of bicliques ... above and the other is K(R G ì S H ,S G ì R H ). A biclique of G ì H which is one of the two bicliques produced from the weak product of a biclique of G and a bicli...

Ngày tải lên: 07/08/2014, 13:21

... the set of labels of the Vertices of H. ã H E denotes the set of labels of the Edges of H. ã B E denotes the set of labels of the Edges Between H and I. ã I V denotes the set of labels of the ... small modification of the proof is required for any countable subgroup of real numbers which does not include 2. For let g be an element of the group such that g ≥ 2. In...

Ngày tải lên: 07/08/2014, 13:21

... purposes of proving that the game coloring number of Cartesian products is not bounded by a function of game coloring numbers of factor graphs. However the class of Cartesian products of stars ... for every n ≥ 2. Hence the existence of an upper bound for the game chromatic number of the Cartesian product of graphs in terms of game chromatic numbers of fa...

Ngày tải lên: 07/08/2014, 21:20

... positive integer and let G be a graph. A set M of matchings of G, all of which of size m, is called an [m]-covering of G if  M∈M M = E(G). G is called [m]-coverable if it has an [m]-covering. ... is minimum is called an excessive [m]-factorization of G and the number of match ings it contains is a graph parameter called excessive [m]-index and denoted by χ ′ [m] (G) (the...

Ngày tải lên: 08/08/2014, 01:20