Báo cáo toán học: "A note on circuit graphs Qing Cui" pot

... 3 of 3-trees in circuit graphs. (They also proved similar results for 3-connected graphs that the electronic journal of combinatorics 17 (2010), #N10 3 A note on circuit graphs Qing Cui Department ... of Gao and Richter’s th eorem that every circuit graph contains a closed walk visiting each vertex once or twice. 1 Introduction We only consider finite graphs without loops or...

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

... A note on circuit graphs Qing Cui Department of Mathematics Nanjing University of Aeronautics and Astronautics Nanjing 210016, P. R. China cui@nuaa.edu.cn Submitted: ... Classifications: 05C38, 05C40 Abstract We give a short proof of Gao and Richter’s th eorem that every circuit graph contains a closed walk visiting each vertex once or twice. 1 Introduction We only consider ... ver...

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

... Transformation Formulas, Discrete Math., 265 (2003), 119–139. [9] L. J. Rogers, On the expansion of some infinite products, Proc. London Math.Soc., 24 (1893), 337–352. [10] L. J. Rogers, On two theorems ... and gave convergence criteria. He used it to obtain results involving q-symmetric expansions and q-orthogonal polynomials. Inspired by their work, we constructed the following q-exponen...

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

... Discrete Math. 307 (2007) 1332–1340. [5] P. Hall, On representatives of subsets, J. London Math. Soc. 10 (1935) 26–30. [6] M. Wo´zniak, A note on embedding graphs without short cycles, Colloq. Math. ... denote the set of neighbours of y. Consider a graph G ′′ := G − {y, z}. Thus W consists of l vertices of degree  1 in G ′′ and one vertex of degree k  l in G ′′ . Note that G ′′ −...

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

... = |Supp(y) ∩ Supp(a)| and by the induction hypothesis x ∈ ∆ k (a), a contradiction. Hence Supp(x) ∩ Supp(y) = ∅. If k is odd, then by the induction hypothesis (k − 3)r 2 + 1 ≤ |Supp(y) ∩ Supp(a)| ... other cycles, as long as the permutation in question is even. The next result shows that we can guarantee this if m is even. In the proofs of Propositions 3.8 and 3.9, the permutations appearing...

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

... PDF corresponds to the article as it appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. A note on the almost sure limit theorem for self-normalized ... below). For information about publishing your research in Journal of Inequalities and Applications go to http://www.journalofinequalitiesandapplications.com/authors/instructions/ For in...

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

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

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

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

... have |I(H t )| = |I(T )| + |I(Y t )| =6+t, Note on Maximal Nonhamiltonian Burkard–Hammer Graphs 409 2. R. E. Burkard and P. L. Hammer, A note on hamiltonian split graphs, J. Combin. Theory Ser. B 28 ... question for all k ≥ 4 and to the second question for all k ≥ 5. We would like to note that there is an interesting discussion about the Burkard–Hammer condition in [9]. Concerni...

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