Báo cáo toán học: "Sudoku Graphs are Integral" ppt

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 y1 w2 h 4" alt =""

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

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

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

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

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

... class="bi x0 y0 w2 h 3" alt =""

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

... Sim, The normality of Cayley graphs of finite abelian groups with Valency 5, System Science and Mathematical Science 13 (2000) 420–431. Cayley Graphs of Abelian Groups Which Are Not Normal Edge-Transitive ... non- normal Cayley graphs of an abelian group are as follows. (1) G = Z 4 ,S = G\{1}, =K 4 . (2) G = Z 4 ì Z 2 = aìb,S = {a, a −1 ,b}, Γ=Q 3 the cube....

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

... solves, in particular, the related problem in Coding Theory mentioned in the introduction. the electronic journal of combinatorics 4 (1997), #R1 2 is isomorphic to H. The H -packing number of G, ... divisor of the degrees of H. Clearly, if the conditions in Wilson’s Theorem hold, then the packing and covering numbers are known. In this paper we solve all of the conjectur...

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

... =1,wehavethatp 1 + αc 1 ≤ [x]e C(x) = c 1 and so c 1 ≤−p 1 /(α − 1) = d 1 . Hence the claim is true when n = 1. Suppose the claim is true for all values less than n.Wehave p n + αc n ≤ [x n ]e C(x) =[x n ]exp(c 1 x ... following: 1. C(x), H(x), and A(x) all have zero radius of convergence; 2. c n ,a n , and n!h n are positive integers; 3. A(x)=exp(H(x)) = exp   j≥1 C(x j )/j  ; 4. lim...

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

... terminology of dimension 2 posets, an increasing subsequence is a chain and a decreasing subsequence is an anti-chain. Permutations which are the union of an increasing and a decreasing subsequence M.D. ... figure the vertical and horizontal lines have the obvious separation meaning; for example, if R and W are red and white points we would ha...

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

... =  2 0 n 1/2 p 1/2 ln(np) . the electronic journal of combinatorics 9 (2002), #R27 5 Sparse graphs usually have exponentially many optimal colorings Michael Krivelevich ∗ Department of Mathematics, Sackler Faculty ... . The theorem is proven. ✷ We have thus proven that most of the graphs in the probability space G(n, p)with p = n −a ,1/3 <a<2, have exponentially...

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

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

... 2 and k = 3. An interesting open problem is whether equality holds for all values of k. the electronic journal of combinatorics 15 (2008), #R49 2 Chromatic Graphs, Ramsey Numbers and the Flexible Atom ... L 3 and those edge colorings of K N which are good with respect to these subsets M. We also remark on the connections of these subsets and colorings to projective pl...

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

... New Graphs of Finite Mutation Type Harm Derksen ∗ Department of Mathematics University of Michigan hderksen@umich.edu Theodore Owen Department of Mathematics Iowa State ... constructed mutation- finite graphs from triangulations of ori- ented bordered surfaces with marked points. We will call such graphs of geometric type”. Besides graphs with 2 vertices, and graphs...

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

... important class of integral graphs. Other examples of integral graphs are the complete graphs K n [2], certain trees [3] and certain circulant graphs [20] (like the unitary Cayley graphs) . Moreover, we ... A(G) are independent of vertex order we call them the eigenvalues of the graph G. We explicitly determine the eigenvalues of Sudoku graphs, which turn out to be integers. Henc...

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