Báo cáo toán hoc:" Anti-Ramsey numbers for graphs with independent cycles Zemin Jin" ppt

... #R85 8 Anti-Ramsey numbers for graphs with independent cycles Zemin Jin Department of Mathematics, Zhejiang Normal University Jinhua 321004, P.R. China zeminjin@hotmail.com Xueliang Li Center for ... of anti-Ramsey numbers for Ω k Unlike graphs in the family Ω 2 , we have no more information about graphs in the family Ω k for k ≥ 3. So we cannot treat the family...

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

... S n on X with D S n (X)=n − 1 for arbitrarily large n? 4 Distinguishing graphs using orbits In this section we apply the theory developed for distinguishing general group actions to graphs. Combining ... ask which distinguishing numbers are associated to a fixed group. In other words, given a group Γ we ask for the set D Γ = {k : k = D(G) for a graph G with Aut(G)=Γ}. For in...

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

... vertices. This implies that the only graphs which have fix(G) = n−1 are the complete graphs and the empty graphs. On the other hand, the graphs with fix(G) = 0 are the rigid graphs [1], which have trivial ... set with exactly one vertex moved by an automorphism from each G j and from H i is a fixing set of G. Therefore fix(G) = i. Since we have constructed a graph G with Aut(G) =...

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

... investi- gated for a range of graphs G. Some additional examples of graphs for which the saturation number is known precisely include small cycles [Oll72] [Che09], complete bipartite graphs [Bol67], ... [KT86] Ta ble 2: Saturation Numbers for Trees of Order 7 Question 2: Can sharper bounds be established for Theorems 12 , 1 3, 16-19? Question 3: For those classes of trees...

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

... Degree powers in graphs with forbidden subgraphs B´ela Bollob´as ∗†‡ and Vladimir Nikiforov ∗ Submitted: Jan 27, 2004; Accepted: Jun 10, 2004; Published: ... that, for any fixed r ≥ 2, lim n→∞ φ (r, p, n) f (p, T r (n)) grows exponentially in p. 4 Triangle-free graphs For triangle-free graphs, i.e., r = 2, we are able to pinpoint the value of p for which ... interesting to find, f...

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

... X) · #blocks(B, Y ) By our choice, X is the longest block with #blocks(A, X) = #blocks(B, X) (informally, a “wrong” block); therefore for all strings Y satisfying X ❁ Y we have #blocks(A, Y ) ... paper on k-SBR [11]. For a (signed or unsigned) string P = a 1 . . . a n , we denote by −P the result of reversal ρ(1, n) of P (e.g., for P = +a + b − d, we have −P = +d − b − a; for P = a...

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

... On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar. 10 (1959), 337–3 56. [5] V. Nikifor ov, The spectral radius of graphs without paths and cycles of specified length, to appear ... contradiction with |A|  |G|. The conclusion of Lemma 1, part (1) follows when |G|  2k − 1 since then the hy- pothesis is fa lse. Assume now that |G|  2k and that the Lemma holds for...

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

... there exists a reduced word for w having, as a prefix, a reduced word for u. Conversely, if u  w then any given reduced word for u is a prefix of some reduced word for w. For any J ⊆ S, the standard ... s n )-sorting word for w is also called a c-sorting word for w. Thus there are typically several c-sorting words for w, but exactly one (s 1 · · · s n )-sorting word for w fo...

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

... Bielak, Size Ramsey numbers for some regular graphs, Electronic Notes in Discrete Math. 24 (2006), 39–45. [2] P. Erd˝os, R. Faudree, C. Rousseau and R. Schelp, The size Ramsey numbers, Period. Math. ... arbitrary graph with q edges, where q ≤ c(m, n) n 2 2 (m−1)n . Let us consider a random red-blue edge-coloring of G, in which each edge is red with probability 1/2 and the edges are...

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

... q-Euler numbers, and polynomials. 2. q-Bernoulli, q-Euler numbers and polynomials related to the Bosonic and the Fermionic p-adic integral on ℤ p In this section, we provide some basic formulas for ... + 1 2 ] k q in (2.4), respectively, we get the following formulas for the p-adic q-Bernoulli and p-adi c q-Euler numbers, respectively, if q Î ℂ p with 0 <|q -1| p <1 as follow...

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