Báo cáo toán học: "Graphs Associated with Codes of Covering Radius 1 and Minimum Distance 2" ppsx

Báo cáo toán học: "Functional calculus with sections of an analytic space " pot

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

Báo cáo toán học: "New Bounds for Codes Identifying Vertices in Graphs" pdf

... 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 degreezero.Since, by symmetry, one element in C2produces two vertices with degree zero or New Bounds for Codes Identifying Vertices in GraphsG´erard Cohencohen@inf.enst.frIiro Honkalahonkala@utu.fiAntoine ... Butthis identifying code is not optimal. Codewords can be deleted without losing the identifying property. We obtain the code of ﬁgure 9. Hence :Theorem 3.1The minimum density of an identifying...

Báo cáo toán học: "A proliﬁc construction of strongly regular graphs with the n-e.c. property" pptx

... showsthat Construction 2 generates many non-isomorphic graphs. We then show that most of the graphs generated have the n-e.c. property in Section 4, thereby completing the proof of Theorem 1.1. The ... proof of the n-e.c. property uses bounds on the expected number of pairs of subsets U, W causing the graph not to be n-e.c. 2 Background The n-e.c. property ﬁrst occurred in the discussion of ... adjacent the electronic journal of combinatorics 9 (2002), #R31 7 A proliﬁc construction of strongly regular graphs with the n-e.c. propertyPeter J. Cameron and Dudley StarkSchool of Mathematical...

Báo cáo toán học: "Bounds for DNA codes with constant GC-content" pdf

... 8 Constant- weight codes correspond to the partition {0, ,q− 1} = {0}∪{1, ,q− 1},and constant- composition codes to the partition {0, ,q− 1} = {0}∪···∪{q − 1}.Ourbounds for DNA codes with constant ... codewords with exactly w occurrences oftwo ﬁxed characters.In this section we give lower bounds for DNA codes that are constructed from bi-nary codes, binary constant- weight codes, and ternary constant- weight ... [20]), and a similar argument applies to constant- weight codes (see e.g. [4]). Here we give an analogue for DNA codes with constant GC-content:Theorem 8 For 0 ≤ d ≤ n and 0 ≤ w ≤ n,AGC4(n,...

Báo cáo toán học: "Asymptotics for the distributions of subtableaux in Young and up-down tableaux" pps

... the proof of Lemma 2 in ourproof of Theorem 1, we will include the full proof of Lemma 2 there.As examples of these lemmas, for the symmetric group, which has m = n(n − 1)/2roots, the asymptotic ... covariance form of X.LetYNbe the sum of N independent copies of X. For any vector v,letp(v) be the probability for the random walk, and let q(v) the density for the corresponding Brownianmotion ... stayswithin the Weyl chamber by integrating bκN(η, λ)overallλ in the Weyl chamber, and then relate this Brownian motion integral to the sum for random walks. the electronic journal of combinatorics...

Báo cáo toán học: "Graphs with chromatic roots in the interval (1, 2)" doc

... continuitythat the chromatic polynomial has a root in the interval (1, 2).We can perform a similar analysis on the graphs obtained by adding the single edgev1v4to X(s, t) with the following ... an in nite family of 3-connected non-bipartite graphs with chromatic roots in the interval (1, 2) thus resolving a conjecture of Jackson’s in the negative. In addition, we brieﬂy consider other ... chromatic roots in (1, 2). In this paper we demonstrate that this conjecture is false, by providing an in nitefamily of 3-connected non-bipartite graphs with chromatic roots in (1, 2), and then...

Báo cáo toán học: "The Minor Crossing Number of Graphs with an Excluded Minor" pot

... journal of combinatorics 15 (2008), #R4 11 The Minor Crossing Number of Graphs with an Excluded Minor Drago BokalDepartment of Combinatorics and OptimizationUniversity of WaterlooWaterloo, Canadadbokal@uwaterloo.caGaˇsper ... Pinontoan and R. Bruce Richter. Crossing numbers of sequences of graphs. II. Planar tiles. J. Graph Theory, 42(4):332–341, 2003.[33] Benny Pinontoan and R. Bruce Richter. Crossing numbers of sequences ... the relationship between minors and the crossing number. One impedimentis that the crossing number is not minor- monotone; that is, there are graphs G andH with H a minor of G, for which cr(H)...

Báo cáo toán học: "On Mixed Codes with Covering Radius 1 and Minimum Distance 2" pot

... combinatorics 14 (2007), #R 51 10 Table II. Bounds on K(r, s, s; 2) for r ≤ 16 and 9 ≤ s ≤ 16 .s = 9 s = 10 s = 11 s = 12 s = 13 s = 14 s = 15 s = 16 r = 1 9 10 11 12 13 14 15 16 r = 2 16 B 18 B 20B ... 71F 72F a85E a96 − 98E a103 − 11 3E 11 0 − 12 6Gr = 13 60 − 65C 66 − 72C 73 − 81F 79 − 84C 85F a98E 10 5 − 11 3E a 117 − 12 8Er = 14 63 − 67C 70 − 76C 77 − 89F 84 − 92C 91 − 97F 98F a 113 E a126 − 12 8Er ... a 113 E a126 − 12 8Er = 15 69 − 73E 76C 84 − 95E 91 − 96C 99 − 10 9F 10 6 − 11 2C 11 3F a128Er = 16 b73H 80 − 84C 88 − 95C 96 − 10 4C 10 4 − 11 9F 11 2 − 12 2C 12 0 − 12 7F 12 8FReferences [1] Blokhuis, A. /...

Báo cáo toán học: "Graphs with many copies of a given subgraph" ppt

... most graphs on n vertices containsubstantially many copies of any ﬁxed graph, but contain no complete bipartitesubgraphs with both parts larger than C log n, for some C > 0, independent of n.Hence, ... graph of order 2;- K2(s, t) for the complete bipartite graph with parts of size s and t;- f|Xfor the restriction of a map f to a set X.Speciﬁc notationSuppose that G and H are graphs, and ... cnr copies of H contains a “blow-up” of H with r − 1 vertexclasses of sizecr2ln nand one vertex class of size greater than n1−cr−1. A similarresult holds for induced copies of H.Main...

Báo cáo toán học: "Graphs Associated with Codes of Covering Radius 1 and Minimum Distance 2" ppsx

... 10 LA0 1 2 X 1 0 X 32 3 1 03 2 0 1 LB0 1 2 X 1 0 X 32 3 0 1 3 2 1 0LC0 1 2 X 1 2 X 32 3 0 1 3 0 1 2LD0 1 2 X 1 3 X 02 0 1 33 2 0 1 LE0 1 2 X 1 3 X 22 0 1 33 2 0 1 LF0 2 1 X 1 ... 32 3 0 1 3 1 2 0LG0 2 1 X 1 3 X 02 1 0 33 0 2 1 LH0 2 1 X 1 3 X 02 0 3 1 3 1 0 2LI0 2 1 X 1 3 X 22 0 3 1 3 1 2 0LJ0 2 1 X 1 3 X 22 1 0 33 0 2 1 LK0 2 3 X 1 0 X 22 3 0 1 3 1 2 0LL0 ... combinatorics 15 (2008), #R68 16 LA0 1 2 X 1 0 X 32 X 3 03 2 0 1 LB0 1 2 X 1 0 X 32 X 3 1 3 2 1 0LC0 1 2 X 1 3 X 02 X 0 33 0 1 2LD0 1 2 X 1 3 X 22 X 0 33 2 1 0LE0 2 1 X 1 0 X 32 X 3 1 3 1...

Báo cáo toán học: "Hurwitz Equivalence in Tuples of Generalized Quaternion Groups and Dihedral Groups" docx

... t2(m−2−ν)(n−n0−···−n2m−2−1)+n0+···+n2m−2−1.Proof. The formulas follow from Corollary 3.2 and simple counting arguments.4 Bn-orbits in Tuples of Dihedral Groups The dihedral group DN of order 2N is given by the ... (2008), #R80 2 Hurwitz Equivalence in Tuples of Generalized Quaternion Groups and Dihedral Groups Xiang-dong HouDepartment of MathematicsUniversity of South Florida, Tampa, FL 33620xhou@math.usf.eduSubmitted: ... 3.1.(iii) Diﬀerent tuples in (4.1) are nonequivalent since they have diﬀerent combinations of invariants λ(a) and π(a). The same is true for the tuples in (4.2). Therefore, it remainsto show that...

Báo cáo toán học: " Graphs with Given Degree Sequence and Maximal Spectral Radius" doc

... of ﬁnding connected graphs of maximal spectral radius with given number of vertices and edges (but arbitrary degree sequences). Brualdi and Solheid [4]have shown that such graphs have stepwise ... of those graphs that have largest spectral radius inthe class of all connected graphs with a given degree sequence. We show that insuch a graph the degree sequence is non-increasing with respect ... graphs Gthat have greatest spectral radius in the class of all graphs with a given degree sequence. We show that in such a graph the degree sequence is non-increasing with respect to anordering...

Báo cáo toán học: "An Inﬁnite Family of Graphs with the Same Ihara Zeta Function" potx

... families of pairs of graphs which share the same zeta function.1. IntroductionIn 2009 , Cooper described an inﬁnite family of non-isomorphic pairs of graphs which sheconjectured had the same Ihara ... 2010Mathematics Subject Classiﬁcation: 05C38AbstractIn 2009, Cooper presented an inﬁnite family of pairs of graphs which were con-jectured to have the same Ihara zeta function. We give a proof of ... An Inﬁnite Family of Graphs with the Same Ihara Zeta FunctionChristo pher StormDepartment of Mathematics an d Computer ScienceAdelphi Universitycstorm@adelphi.eduSubmitted:...

Báo cáo toán học: "Inﬁnitely many hypermaps of a given type and genus" pot

... coverings of these gives inﬁnitely many hypermaps of type (l, m, n) and genus g  3.In particular, taking m = 2, if we can construct inﬁnitely many planar maps of a given type, each with at least ... and −1 + i, the vertex at 2 to 0 and 1 + i, and the vertex at 2i to 1 + i and −1 + i.We have then, a t this stage, three triangular faces and one face of valency 6. Inside thishexagonal f ace ... allowingjoining at its ends. The resulting map will have 2h faces of valency 2n and all other faces of valency 2 or 4. Since all the vertices have valency m, the map is a Walsh bipartite map of a hypermap of...

Báo cáo y học: "Mortality associated with administration of highdose tranexamic acid and aprotinin in primary open-heart procedures: a retrospective analysis" ppt

... Table 4 Safety data of patients receiving aprotinin and tranexamic acid Aprotinin Tranexamic acid PMyocardial infarction (ICU) All patients N 8 6 0.78 Open-heart procedures 0 2 0.04All patients ... erning t he treatment with and, if treated, how manyTable 1 Baseline characteristics of the patients in the aprotinin and tranexamic acid groups Aprotinin Tranexamic acid Mean SD Mean SD PAge ... Biochemical data of patients receiving aprotinin and tranexamic acid Aprotinin Tranexamic acid Mean SD Mean SD PCreatinine after surgery (mg/dL)All patients 1.1 0.7 1.2 0.8 0.02 Open-heart procedures...

Xem thêm

Từ khóa: chuyên đề điện xoay chiều theo dạng Biện pháp quản lý hoạt động dạy hát xoan trong trường trung học cơ sở huyện lâm thao, phú thọ Giáo án Sinh học 11 bài 13: Thực hành phát hiện diệp lục và carôtenôit NGHIÊN CỨU CÔNG NGHỆ KẾT NỐI VÔ TUYẾN CỰ LY XA, CÔNG SUẤT THẤP LPWAN SLIDE Trả hồ sơ điều tra bổ sung đối với các tội xâm phạm sở hữu có tính chất chiếm đoạt theo pháp luật Tố tụng hình sự Việt Nam từ thực tiễn thành phố Hồ Chí Minh (Luận văn thạc sĩ)Phát triển du lịch bền vững trên cơ sở bảo vệ môi trường tự nhiên vịnh hạ long Nghiên cứu về mô hình thống kê học sâu và ứng dụng trong nhận dạng chữ viết tay hạn chế Định tội danh từ thực tiễn huyện Cần Giuộc, tỉnh Long An (Luận văn thạc sĩ)Thơ nôm tứ tuyệt trào phúng hồ xuân hương Thiết kế và chế tạo mô hình biến tần (inverter) cho máy điều hòa không khí Tăng trưởng tín dụng hộ sản xuất nông nghiệp tại Ngân hàng Nông nghiệp và Phát triển nông thôn Việt Nam chi nhánh tỉnh Bắc Giang (Luận văn thạc sĩ)Giáo án Sinh học 11 bài 15: Tiêu hóa ở động vật Giáo án Sinh học 11 bài 15: Tiêu hóa ở động vật Giáo án Sinh học 11 bài 14: Thực hành phát hiện hô hấp ở thực vật Giáo án Sinh học 11 bài 14: Thực hành phát hiện hô hấp ở thực vật Giáo án Sinh học 11 bài 14: Thực hành phát hiện hô hấp ở thực vật Chiến lược marketing tại ngân hàng Agribank chi nhánh Sài Gòn từ 2013-2015 HIỆU QUẢ CỦA MÔ HÌNH XỬ LÝ BÙN HOẠT TÍNH BẰNG KIỀM TÁI CHẾ NHỰA VÀ QUẢN LÝ CHẤT THẢI Ở HOA KỲ QUẢN LÝ VÀ TÁI CHẾ NHỰA Ở HOA KỲ