Báo cáo toán học: "Constructions for cubic graphs with large girth" pdf

... Fully formatted PDF and full text (HTML) versions will be made available soon. Inequalities for convex and s -convex functions on Delta=[a,b]x[c,d] Journal of Inequalities and Applications 2012, ... dierentiable mapping on = [a, b] ì [c, d] . If    ∂ 2 f ∂t∂s    q , q > 1, is a convex function on the co-ordinates on ∆, INEQUALITIES FOR CONVEX AND s...

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

... 2011:10 http://asmp.eurasipjournals.com/content/2011/1/10 Page 11 of 11 RESEARCH Open Access System for fast lexical and phonetic spoken term detection in a Czech cultural heritage archive Josef Psutka, Jan ... automatically gradually adapted to each individual speaker. This unsupervised iterative speaker adaptation algorithm employs both fMLLR and MAP methods (...

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

... Discussion In this article, we have introduced a testable criterion for robustness for a given cycle of heteroclinic con- nections within constrained settings—this test involves finding the connection ... C 1 perturbations in X . The HC may, however, be robust to a constrained set of perturbations. We explore this in the following sections. 2.1 Conditions for robustness...

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

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

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

... on generalized convolu- tion, for instance: the generalized convolution for integral transforms Stieltjes, Hilbert and the cosine- sine transforms [12], the generalized convolution for H- transform ... γ(y)=sign y for the Fourier, Fourier cosine and sine transforms of functions f and g has a meaning and belongs to L(R) and the factorization...

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

... C.C.Rousseau and R.H.Schelp, Ramsey minimal graphs for star forests, Discrete Math. 33 (1981), 227–237. [4] S.A.Burr, P.Erd˝os, R.J.Faudree, C.C.Rousseau and R.H.Schelp, Ramsey minimal graphs for match- ings,inThe ... Threshold functions for Ramsey properties,submitted. Key words and phrases: critical graphs, Ramsey theory 1991 Mathematics Subject Classifications: 05D10, 05C80 4 O...

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

... and φ cannot be distinguishing. This contradicts our assumption that φ is an r-distinguishing labeling. ✷ We remark that this proves that the largest integer in D(S 3 )is3,since the subgroups ... the goal is to minimize the number of colors used. Consequently we define the distinguishing number of a graph G by D(G)=min{r | G has a labeling that is r-distinguishing}. The original key problem...

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

... the class of all 4-chromatic graphs. The structure of the red graph is obvious by Corollary, but we do not know which graphs can occur as blue graphs and what are the properties of graphs in which ... on the Wall, a list of conjectures of Graffiti. Ramseyan Properties of Graphs by Ermelinda DeLaVina delavina@math.uh.edu Siemion Fajtlowicz siemion@math.uh.edu Uni...

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

... The notion of orthogonal colorings is strongly related to the notion of orthogonal Latin squares. The orthogonal chromatic number of G, denoted by Oχ(G), is the minimum possible number of colors ... 2, 3, 1, 3). The notion of k -orthogonal colorings is strongly related to the notion of orthogonal Latin squares. Recall that two Latin squares L 1 ,L 2 of order r are...

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

... shown that cubic graphs with arbitrarily large girth exist (see Theorem 3.2) and so there is a well-defined integer à 0 (g), the smallest number of vertices for which a cubic graph with girth ... account of the problem of constructing cubic graphs with large girth. There is a well-dened integer à 0 (g), the smallest number of vertices for which a cubic graph with gi...

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

... 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}.Our bounds for DNA codes with constant ... codewords with exactly w occurrences of two fixed characters. In this section we give lower bounds for DNA codes that are constructed from bi- nary codes, binary cons...

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

... , proving (8). Inequality (9) follows easily, since, in fact, for every p>3, the function g (x)hasa local minimum at 0. ✷ 5 H-free graphs In this section we are going to prove the following ... (5), we obtain that (r −1)  n p +1  +  2n p +1  <n. Letting n →∞, we see that p ≥ r, contradicting the assumption and completing the proof. ✷ Maximizing independently each summand in...

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

... Lemma 1 For convenience we shall assume that the set B is independent. Also, we shall call a pat h with both ends in A an A- path. Claim 6 If G contains an A- path of order p > 2, then G contains ... Nikifor ov, The spectral radius of graphs without paths and cycles of specified length, to appear in Linear Algebra Appl. Preprint available at arXiv:0903.535 [6] J. Verstraăete,...

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

... set for H G,C with C = {(1 , 2), (2, 3), ( 3 , 4), (4, 5 ), (5, 1)}. Let G be an undirected graph with vertex set V and edge set E, and consider the auxiliary directed graph ˜ G with vertices ... class of graphs with encodings that have degree o ne infeasibility certificates in- cludes all graphs containing odd wheels as subgraphs (e.g., a 4-clique) [34]. Corollary 2.2. If a graph...

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

... = Γ 12 . Hence all of the connected, regular integral graphs up to seven vertices are Cayley graphs. In other words there are exactly 12 connected, integral Cayley graphs up to seven vertices. It ... Cayley graphs with 10 vertices.  Lemma 2.23 There are exactly three connected, integral Cayley graphs with nine vertices. Proof. We show that the graphs Γ 19 , Γ 21 and Γ 24 a...

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