Báo cáo toán học: "On Computing the Distinguishing Numbers of Trees and Forests" pps

... 95% confidence interval. Dilemmas in the reliable estimation of the in- vitro cell viability in magnetic nanoparticle engineering: which tests and what protocols? Clare Hoskins 1 , Lijun ... number of factors including an increase in the coating diameter upon addition of the PEG moiety [33], thus increasing the stability of the nanopar...

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

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

... on H  2,4 , then this only extends to a 2-coloring of the larger graph, whereas from the 4-coloring we obtain all other values in the spectrum. It remains to prove the necessity of the condition. ... consider the mixed hypergraph obtained from H  2,4 by including the vertices {7, ,t+2} and placing them in region ∗. Also include the C-edges {367, 368, ,36(t+ 2)}. If...

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

... electronic journal of combinatorics 9 (2002), #R21 10 On counting permutations by pairs of congruence classes of major index H ´ el ` ene Barcelo and Robert Maule Sheila Sundaram Department of Mathematics ... give a constructive proof of an equivalent restatement of Propo- sition 2.5, by looking at the circular classes of permutations τ ∈ S n which fix n. Not...

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

... edge-disjoint one factors and the existence of k -factors in complete multipartite graphs, Discrete Math. 160 (1996) 177–187. [5] T. Niessen and B. Randerath, Regular factors of simple regular graphs ... Theorems, Jahresber. Deutsch. Math Verein. 97 (1995) 19–42. the electronic journal of combinatorics 11 (2004), #R7 7 On regular factors in regular graphs with smal...

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

... attention to computing the distinguish- ing numbers of rooted trees. 3 Distinguishing labelings of rooted trees In this section, we give a characterization of the distinguishing labelings of rooted ... the symmetries of G because the only member of the automorphism group of (G, φ) is the identity map. The distinguishing number of G, D(G), is the m...

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

... 1. the electronic journal of combinatorics 14 (2007), #R43 18 On certain integral Schreier graphs of the symmetric group Paul E. Gunnells ∗ Department of Mathematics and Statistics University of ... 2007 Mathematics Subject Classification: 05C25, 05C50 Abstract We compute the spectrum of the Schreier graph of the symmetric group S n corresponding to the Y...

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

... 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 6G r = 13 60 − 65C 66 − 72C 73 − 81F 79 − 84C 85F a98E 10 5 − 11 3E a 117 − 12 8E r = 14 63 − 67C 70 − 76C 77...

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

... subgraph of a self-complementary graph H of order n with a cyclic self-complementary permutation. By Lemma 2, we obtain that if the star K 1,k is a subgraph of a self-complementary graph of order ... structure of self-complementary permutations. By Theorem 6, the expectation that a graph is a subgraph of a self-complementary graph H of the same order rises with the n...

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

... θ increases from 0 to π 2 . Also, the signs of these integrals alternate, so we can either throw out all of them or all but the first one, depending on whether the integral of h across R ⌊ r π ⌋ is positive ... establishes that the measurable chro matic number of the odd-distance graph is infinite. 4 Conclus i on and Open Problems The largest remaining question is whether or not...

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

... means of series–rearrangements and finite differences, elementar y proofs are presented for the well–know n convolution identities of Abel and Hagen–Rothe. 1 Introduction There are numerous identities ... [16], this short paper will present elementary proofs for the convolution identities of Abel and Hagen–Rothe. It may be unexp ected that these proofs are su...

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

... constant of G and r(G) the rank of G . ã Let ol(G) denote the maximal length of a sequence X over G which is zero-sum free and squarefree. The invariant ol(G) is called the Olson constant of G. 3 ... progression of difference d, then |(S + x)\S| = min{|S|, n − |S|, k, n − k}, the electronic journal of combinatorics 17 (2010), #R104 6 On zero-sum free subsets of leng...

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

... r ed ucing a constant term in 2k variables to a constant term in k variables. As applications, Zeilberger’s constant terms are converted to single determinants. The result extends for two classes ... Jacobi’s Change of Variable Formula We first complete the proof of Identity 2 by transforming the constant term into known constant terms. Here, we mean Macdonald’s constant...

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

... q-tangent and q-cotangent functions. Discrete Math. Theor. Comput. Sci., 12(2):47–64, 2010. the electronic journal of combinatorics 18(2) (2011), #P18 7 Continued fractions related to (t, q)-tangents ... = sin q (u) cos q (u) generalises for w = q r the Foata and Han version, and for w = −1 the Cieslinski version. Our elementary approach can handle this situation as well: S...

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