Báo cáo toán học: "On the Graphs of Hoffman-Singleton and Higman-Sims" docx

Báo cáo toán học: " On the boundedness of the solutions in nonlinear discrete Volterra difference equations" pot

Báo cáo toán học: " On the boundedness of the solutions in nonlinear discrete Volterra difference equations" pot

... norm on R d . In recent years, there has been an increasing interest in the study of the asymptotic behavior of the solutions of both convolution and non-convolution-type linear and nonlinear Volterra ... aim in this section is to obtain sufficient condition for the boundedness of the solution of (1.1) under the initial condition (1.2), but in the linea...

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

24 371 0
Báo cáo toán học: "On the smoothness of sphere extensions " ppsx

Báo cáo toán học: "On the smoothness of sphere extensions " ppsx

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

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

11 489 0
Báo cáo toán học: "On the Continuity of Julia Sets and Hausdorff Dimension of Polynomials" ppsx

Báo cáo toán học: "On the Continuity of Julia Sets and Hausdorff Dimension of Polynomials" ppsx

... study the continuity of Julia set of some rational maps and the stability of the Hausdorff dimension of the Julia set of polynomials z d + c (d ≥ 2)forsome semi-hyperbolic parameters c in the boundary ... Vietnam Journal of Mathematics 33:3 (2005) 283–289 On the Continuity of Julia Sets and Hausdorff Dimension of Polynomials Zhuang Wei Institu...

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

7 357 0
Báo cáo toán học: "On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs" ppsx

Báo cáo toán học: "On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs" ppsx

... n)k −1 φ(k). In either case, the inequality in part 1 of the lemma holds. On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs Alan Frieze ∗ Department of Mathematical ... of combinatorics 7 (2000), #R57 4 3 Hamilton Cycles A Hamilton cycle is the union of two perfect matchings and so h(G) ≤ 1 2 m(G) 2 a...

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

11 336 0
Báo cáo toán học: "On the orbits of Singer groups and their subgroups" pot

Báo cáo toán học: "On the orbits of Singer groups and their subgroups" pot

... orbits of Singer groups or subgroups of Singer groups. It seems, however, that only point (and, in the case the electronic journal of combinatorics 9 (2002), #R15 8 orbits of any Singer cycle of Σ n−1 on ... In the statement of the following theorem, à denotes the Măobius function, the basic properties of which can be found in, for example, [1]. Theore...

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

10 271 0
Báo cáo toán học: "On the connectivity of graphs embedded in surfaces II" docx

Báo cáo toán học: "On the connectivity of graphs embedded in surfaces II" docx

... these bounds are attained by complete graphs in all cases except the Klein bottle. In [PZ1] we explored in more detail relations between the connectivity of embedded graphs and the surfaces in ... κ gen <κ max for these surfaces. In [PZ1] these are called Class B surfaces and it is shown there that such surfaces must occur periodically in nitely often as...

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

27 295 0
Báo cáo toán học: "On the Graphs of Hoffman-Singleton and Higman-Sims" docx

Báo cáo toán học: "On the Graphs of Hoffman-Singleton and Higman-Sims" docx

... same family of maximum cocliques of X and hence there exists an automorphism of Z mapping X to Y . Proof. The statement of the lemma gives sufficient indication of the proof. We note that the lemma ... The subgraph of order 80 induced by four of these subgraphs W i is identified as the second orbit of the stabiliser of the remaining one of these graphs in...

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

33 436 0
Báo cáo toán học: "On the number of possible row and column sums of 0,1-matrices" pps

Báo cáo toán học: "On the number of possible row and column sums of 0,1-matrices" pps

... x and y to be row and column sums of a matrix is that they have the same weight. Clearly, the row sums of a member of M are at most n.Conversely,ifx =(x 1 , ,x m ) and 0 x i n,letR = R(x)bethem ... (5) the electronic journal of combinatorics 13 (2006), #N8 5 3 Start of the proof Let N = {0, 1, }. Define the weight of a matrix N to be the sum of its e...

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

6 242 0
Báo cáo toán học: "On the symmetry of the distribution of k-crossings and k-nestings in graphs" pot

Báo cáo toán học: "On the symmetry of the distribution of k-crossings and k-nestings in graphs" pot

... ∗, se = k), where the ∗ indicates that there is no the electronic journal of combinatorics 13 (2006), #N21 3 On the symmetry of the distribution of k-crossings and k-nestings in graphs Anna de ... c k ) is in the diagram. We are interested in counting fillings where the sum of the entries is fixed. Let N(F ; m; ne = k, se = l) be the number of arbitrar...

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

6 180 0
Báo cáo toán học: "On the Number of Matchings in Regular Graphs" pptx

Báo cáo toán học: "On the Number of Matchings in Regular Graphs" pptx

... get the numerator of the right-hand side of (4.10). Divide this number of choices by the number of permutations of {1, . . . , rn} to deduce the lemma. ✷ Using the methods in the proof of Theorem ... := r i=1 A i . Let m ∈ min(p, q). Then perm m A is the number of m -matchings of G := ∨ r i=1 G i , which is equal to the number of m -matchings o...

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

28 263 0
Báo cáo toán học: "On the Energy of Unitary Cayley Graphs" pot

Báo cáo toán học: "On the Energy of Unitary Cayley Graphs" pot

... proof of the result of Balakrishnan [1] when n is a power of a prime. Theorem 3.1. If n = p α is a prime power, then the energy of the unitary Cayley graph X n is given by E(X n ) = 2φ(n). Proof. ... multiplicity. 2. The multiplicity of zero as an eigenvalue of X n is n − m. 3. If α(λ) is the multiplicity of the eigenvalue λ of X n , then λα(λ) is a multiple...

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

8 279 0
w