Báo cáo toán học: "On regular factors in regular graphs with small radius" ppsx

... contain transi- ent noise. Every speech signals and transient noise sig- nals are recorded in real environment, separately. The transient noise signals are acquired by using mobile recoding devices ... linear fil- tering methods cannot remove transient noise easily which has abruptly varying characteristic [4-6]. In gen- era l, transient noise is generated by tapping a...

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

... class="bi x0 y0 w1 h 1" alt =""

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

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

... alt =""

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

... class="bi x0 y0 w5 h 1" alt =""

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

... modular invariant theory of the general linear group at the prime p = 2. In [8], Hung and the author gave a mod-p analogue of the Singer invariant-theoretic description of the dual of the lambda algebra ... part by the Vietnam National Research Program Grant 140801. On an Invariant-Theoretic Description of the Lambda Algebra 29 where a n,k ∈ F p and...

Ngày tải lên: 06/08/2014, 05: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

... matchings and Hamiltonian cycles in random graphs. Annals of Discrete Mathematics 28 (1985) 23-46. [6] B. Bollob´as, T.I. Fenner and A.M. Frieze. An algorithm for finding Hamilton cycles in random graphs. ... Cooper. 1-pancyclic Hamilton cycles in random graphs. Random Structures and Algorithms 3.3 (1992) 277-287 [9] C. Cooper and A. Frieze. Pancyclic random graphs....

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

... 07 932- 0971, USA Submitted: April 9, 1998; Accepted: April 13, 1998 ABSTRACT An elementary construction using binary codes gives new record kissing numbers in dimensions from 32 to 128. 1. Introduction Let ... 1,260,230,400 in dimensions 32, 64 and 128, for example). In contrast, Quebbemann’s lattice Q 32 [14], [5, Chap. 8] has τ = 261,120. In recent years the kissing...

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

... 1-factor F containing e  and thus F is the 1-factor avoiding e. the electronic journal of combina torics 12 (2005), #N23 2 Pan-factorial Property in Regular Graphs ∗ M. Kano 1 and Qinglin Yu 23 1 Department ... 1-factor containing e,so does G ∗ . By Theorem 1, G ∗ has a k-factor containing e and another k-factor avoiding e for all k,1≤ k ≤ 2r − 1. Deleting the matching M from G ∗ ,weo...

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

... the resulting digraph D  is acyclic. If true, this conjecture would imply the following strengthening of Lemma 5: Each digraph D obtained from a tournament by deleting k edges, that has no directed triangles, has ... with minimum outdegree at least αn has a directed 3-cycle. Theorem 3. If β ≥ 0.34564, then each n-vertex digraph D in which both minimum outdegree and minimum indegree i...

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

... decreasing (resp. increasing), and so the log-concavity implies the unimodality. The unimodality problems, including concavity (convexity) and log- concavity (log-convexity), arise naturally in many ... combinatorial interpretation. Lattice path techniques have been shown to be useful in solving the unimodality problem. As an example, we present a combinatorial proof of Theorem 1 (i...

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

... T. Szab´o, Fast winning strategies in Avoider-Enforcer games, Graphs Combin., 25 (2009), 533–544. [7] D. Hefetz, M. Krivelevich, M. Stojakovi´c and T. Szab´o, Fast winning strategies in Maker-Breaker ... later Hefetz et al. [7] studied the fast winning in Maker-Breaker Hamiltonicity game. We would like to emphasize that, generally speaking, results on fast winning in...

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

... 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