Báo cáo toán học: "General bounds for identifying codes in some infinite regular graphs" docx

... that f(t) is strictly increasing in [1, +∞). 9 Sharp bounds for Seiffert mean in terms of root mean square Yu-Ming Chu ∗1 , Shou-Wei Hou 2 and Zhong-Hua Shen 2 1∗ Department of Mathematics, Huzhou ... below). For information about publishing your research in Journal of Inequalities and Applications go to http://www.journalofinequalitiesandapplications.com/authors/i...

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

... Guesmia, A: General decay rates of solutions to a nonlinear wave equation with boundary condition of memory type. Differential Integral Equations. 18, 583–600 (2005) 16. Messaoudi, SA, Soufyane, A: ... doi:10.1016/S0362-546X(01)00781-7 24. Aassila, M, Cavalcanti, MM, Domingos Cavalcanti, VN: Existence and uniform decay of the wave equation with nonlinear boun...

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

... appear. [2]G.D.Cohen,I.Honkala,S.LitsynandA.Lobstein:Covering Codes, Elsevier, 1997. [3] M.G.Karpovsky,K.ChakrabartyandL.B.Levitin: Onanewclassofcodes for identifying vertices in graphs, IEEE Trans. Inform. Th., vol. 44, ... vertex of degree zero. Since, by symmetry, one element in C  2 produces two vertices with degree zero or New Bounds for Codes Identifying Vertices...

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

... bounds on the size of union-free families. the electronic journal of combinatorics 5 (1998), # R39 11 4 Lower bound on f We give a construction of a (strongly) union-free family of subsets of ... ≤ n  i=1 H(2p i − p 2 i ) ≤ nφ(p) (since pn =  p i ). Therefore αn ≤ 1 2 [β(p)+φ(p)+o(1)]n. New Bounds for Union-free Families of Sets Don Coppersmith (email: copper...

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

... asymptotic bounds for b (m, n ) for m ≥ 2 fixed and n → ∞. 1 Introduction Recent exact results for bipartite Ramsey numbers [4] have rekindled interest in this subject. The bipartite Ramsey number ... Asymptotic Bounds for Bipartite Ramsey Numbers Yair Caro Department of Mathematics University of Haifa - Oranim Tivon ... The following variation was considered by Beineke...

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

... Lobstein: The minimum density of an identifying code in the king lattice, Discrete Mathematics, submitted. [4] I. Charon, O. Hudry, A. Lobstein: Identifying codes with small radius in some in nite regular ... Lobstein, G. Z´emor: New bounds for codes identifying vertices in graphs, Electronic Journal of Combinatorics, vol. 6(1), R19, 1999. [7] G. Cohen, I. Honkala, A....

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

... several counting problems on the square lattice L n . There the authors gave the following bounds for the asymp- totics of f(n), the number of forests of L n ,and (n), the number of acyclic orienta- tions ... y>0andz t y =1. the electronic journal of combinatorics 10 (2003), #R4 15 Improved bounds for the number of forests and acyclic...

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

... Interpretations for Rank-Two Cluster Algebras of Affine Type Gregg Musiker Department of Mathematics University of California, San Diego La Jolla, CA 92093-0112 gmusiker@math.ucsd.edu James Propp Department of ... know this interpretation for the coefficients of x n+3 (s n ), we obtain a proof of the formula for the entire sum, i.e. Theorem 2 and Theorem 5.2 of [4] (...

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

... with n = 7 and s = 27 and get 8k 5 + 15k 6 + 22k 7 + 29  i 8 k i ≤ 58. (8) Multiplication with 3/22 and rounding off yields Lemma 3. the electronic journal of combinatorics 14 (20 07) , #R 27 4 5 ... we show k 3 (7) ≥ 156 and k 3 (8) ≥ 402 improving on the best previously known bounds k 3 (7) ≥ 153 and k 3 (8) ≥ 3 98. The proofs are founded on a recent technique...

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

... key ingredient of our proof. Given the informal discussion above, the proof of Theorem 1.1 looks very roughly as follows. At the first part of the proof we consider the graph G(n, ρ) for a relatively ... claim holds for d − 1. We prove the claim for d. Let S = (G 1 , G 2 , . . . , G d ) be the sequence of the labels of the nodes u i , i ∈ [d], along the path...

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

... combinatorics 16 (2009), #R102 4 Tight Bounds for Quasirandom Rumor Spreading Spyros Angelopoulos Benjamin Doerr Anna Hub er Konstantinos Pana giotou Max-Planck-Institut făur Informatik, 66123 Saarbrăucken, ... determined in [8] similar bounds for several Cayley graphs. The Quasirandom Push Model Recently, Doerr, Friedrich, and Sauerwald [7] pro- posed a quasi...

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

... entrywise bounds for second and lower eigenvectors of adjacency matrix of Planted partition models. We make a step towards resolving these questions through computing entrywise bounds for the second ... entrywise perturbation for eigenvectors of Random graphs, i.e. v 1 (A) −v 1 (E(A)) ∞ (where v 1 (M) is the first eigenvector of a square symmetric matrix M). Perturbat...

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

... (i) and (iv) P 3 ∩ P 4 = {x} with x ∈ Z 6 . Let R denote a set the electronic journal of combinatorics 16 (2009), #R133 5 Lower Bounds for q-ary Codes with Large Covering Radius Wolfga ng Haas Immanuel ... the case k = 5. For k > 5 the computational effort became too la r ge for a systematical treatment. Here we got only a few sporadic new bounds: six bounds for k...

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

... electronic journal of combinatorics 17 (2010), #R122 6 References [1] Ir`ene Charon, Iiro Honkala, Olivier Hudry, and Antoine Lobstein. General bounds for identifying codes in some in nite regular graphs. ... of density in certain in nite graphs which are locally finite. We present new lower bounds for densities of codes for some sm all values of r in both the squa...

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

... such a polygon do not change genus of such a surface. Operation 1: Aaa − ∼ A, Operation 2: AabBab ∼ AcBc, Operation 3: AB ∼ {(Aa), (a − B)}, A A a a A B a b b a A B c c A B A Bc c Figure 4: Operation ... attaching ears serially or by bar -amalgamation of a cactus to G N The authors of [5] discussed a Kuratowski type theorem for average genus of graph...

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