Báo cáo toán học: "Perfect dominating sets in the Cartesian products of prime cycles" docx

... Follistatin, Chordin and Noggin [12]. These proteins are antagonists of BMP and other members of the TGF-b family, binding to and inhibit- ing these signaling molecules from binding to their receptors ... BMPs in the early development of zebrash FEBS Journal 274 (2007) 29602967 ê 2007 The Author Journal compilation ê 2007 FEBS 2963 MINIREVIEW Bone morphogenetic prote...

Ngày tải lên: 19/02/2014, 00:20

... Identifying Linguistic Structure in Aggregate Comparison. Literary and Linguistic Computing, 21(4). Petya Osenova, Wilbert Heeringa, and John Nerbonne. 2007. A Quantitive Analysis of Bulgarian Dialect Pronunciation. ... (Manning and Schütze, 1999). Multidimensional scaling is data analysis technique that provides a spatial display of the data revealing relationships betw...

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

... for data in the presence (d)andabsence(m)ofDu. 1988 P. Turina and B. A. Melandri (Eur. J. Biochem. 269) Ó FEBS 2002 A point mutation in the ATP synthase of Rhodobacter capsulatus results in differential ... differential contributions of DpH and Du in driving the ATP synthesis reaction Paola Turina and B. Andrea Melandri Department o...

Ngày tải lên: 21/02/2014, 03:20

... been suggested that they may insert spontaneously into the thylakoid membrane. The initial stages of this spontaneous insertion mechan- ism involve binding of the intermediate-size protein to the membrane, ... 2002 Unique structural determinants in the signal peptides of ‘spontaneously’ inserting thylakoid membrane proteins Christophe Tissier, Cher...

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

... Yao, Reid’s conjecture on score sets in tournaments, Kexue Tongbao 33 (1988) 481–484 (in Chinese). 7. T. X. Yao, On Reid’s conjecture of score sets for tournaments, Chinese Sci. Bull. 34 (1989) ... of Reid’s conjecture by pure arithmetical analysis which appeared in Chinese [6] in 1988 and in English [7] in 1989. In the following result, we prove that any set of p non...

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

... (1) The second ingredient of our proof is the following result of Stiebitz. Lemma 3 ([5]) Let G be a k-critical graph containing at least one vertex of degree k − 1. Then the number of connected ... that n L > 0. An improved bound on the minimal number of edges in color-critical graphs Michael Krivelevich ∗ School of Mathematics, Institute for Advance...

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

... no triangles and |Z| k1 Ã|Y \Q|.Then k1 Ã|Y \Q||Z|à(Y )= k Ã|Y |. the electronic journal of combinatorics 9 (2002), #R22 18 Triangle Free Sets and Arithmetic Progressions – Two Pisier Typ e ... three triangles and since |Y | = 6, there can be no point of degree 3. Any two points of S lie in at least two distinct triangles, and thus Y contains exactly 3 triangles...

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

... large integers . Theorem 3.1. The graph G ì + contains -bundles for arbitrarily large integers .Inpar- ticular, for any positive integer , the graph G ì + contains subgraphs of the following type: n  n 1  S S S S S S S S S S S S S S S S S S S S S S S S  k k k k k k k k k k k k k k k k k k k k k k k k k k n 2  M M M M M M M M M M M M M M M M M  p p p p p p p p p p p p p...

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

... completes our proof since the manipulations at the beginning of the section prove that the two quotients in (5.42) have the same Hilbert series. References [1] Yu. Berest, P. Etingof and V. Ginzburg, ... QI m (D n ) of m-quasi-invariants of D n . More precisely we have the electr onic jou rnal of combinatorics 12 (2005), #R20 8 Proof Because of uniqueness of the e...

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

... the following theorem. Theorem 2 Let 2n + 1 be a prime and F be the family of all minimum dominating sets of Γ(Z n 2n+1 , U). Every S ∈ F has a defining set of size at most n!2 n . The proof of ... 5 this case there are perfect dominating sets with defining number 2 (See Remark 3). So far there is no nontrivial bound known for the defining numbers of minimum dominat...

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

... is r -identifying in all graphs G  that can be obtained from G by deleting at most t edges, we say that C is robust against t known edge deletions. Codes that are robust against t unknown edge ... to study codes that remain identifying, for instance, when some edges are deleted in the underlying graph. In this paper we consider the following two classe...

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

... in the d-dimensional torus of side length 2n+ 1 corresponds to an independent set in C d 2n+1 . (This correspondence between packings of cubes in the torus and independent sets in powers of odd ... classification of all maximum independent sets in powers of odd cycles of the form C d k2 d +1 . 1 Introduction Consider the following nat ura l packing probl...

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

... that in Lemma 4, below, we need to use three extra columns to ‘connect’ two corner-avoiding minimal percolating sets. The next lemma explains our interest in corner-avoiding minimal percolating sets. Lemma ... a minimal percolating set (MinPS) if A percolates in r-neighbour bootstrap percolation, but no proper subset of A percolates. Clearly a percolating set of minimal si...

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

... m) ≍ log m. Here and in the sequel the symbol a ≍ b means a ≪ b and b ≪ a while the electronic journal of combinatorics 17 (2010), #R100 6 On some densities in the set of permutations Eugenijus ... nontrivial outside the region of classical large deviations. Further, we apply them by inserting into the equalities given in Proposition 1. The very idea goes back...

Ngày tải lên: 08/08/2014, 12:22

... have an embedding of H in G, completing the proof. ✷ To complete the proof o f Theorem 1.1, we only need to apply the f ollowing classi- cal result of Erd˝os [10] regarding the extremal number ... v t v 1 v 2 }. On the other hand, C 4 , C 6 and C 10 do not admit k-partite representations for any k. The importance of these considerations lies in the following theorem. T...

Ngày tải lên: 08/08/2014, 12:22