Báo cáo toán học: "Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs" ppt

... randomly chosen regular bipartite multi– graph is drawn in the plane in the “standard way”, what is the distribution of its maximum size planar matching (set of non–crossing disjoint edges) and ... (P(π),Q(π)) of Young tableaux of m of the same shape by, • sequentially row inserting π(1), , π(m) to an initially empty pair of tableaux, and thus obtaining P...

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

... PPM, and the T 0 of GFSK equals the T 0 of PPM. In the following, when a value of δ is given, it implies that T 0 and T 1 also have the same value. The analytical BER curves of PPM and GFSK are ... signal bandwidth of a single pulse in a GFSK system is at most one half of that of a PPM system. But this does not mean that the maximum possible data ra...

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

... YJC and ZW carried out the studies on nonlinear analysis and applications, wrote this article together and participated in its design of this paper. All authors read and approved the final manuscript. Competing ... operator in Banach spaces and the concept of the generalized nonexpansive mapping in Banach spaces. Honda et al. [11], Kohsaka and Takahashi [12] also...

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

... nonself mappings which are asymptoti- cally nonexpansive in the intermediate sense in this article. Since the asymptotically nonexpansive in the intermediate sense mappings are non-Lipschitzian and ... Yangzhou 225002, China Abstract In this article, we introduce a new three-step iterative scheme for the mappings which are asymptotically nonexpansive in the intermediat...

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

... Let A = {x, y, z, w} and assume that {z, w} is the single edge in H. In this case there are at least 14 edges from A to B and there must be at least 6 of the A v ’s that have cardinality 2. If there ... follows that there are at least three of the two element A v ’s that contain z and at least three, that contain w. So it is clear that we cannot avoid having either...

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

... =3 )and( 6;m =1) the electronic journal of combinatorics 7 (2000), #R50 11 References [1] M. Abramowitz and I .A. Stegun, Eds., Handbook of Mathematical Functions with Formulas, Graphs and Mathematical ... of Laplace to give a complete asymptotic expansion of the integral. Among the consequences, we have a complete asymptotic expansion for b(n, k)/n!fora range of k inc...

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

... we obtain the order of H as appears in (4). Remark. It is easy to see that the diameter of a k-regular graph of order v is at least log k−1 v and that the random k-regular graph has diameter ... this in such a way that the girth of the subgraph equals a prescribed even integer g. Formulae (5) are not of much help here. Another drawback to this approach is t...

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

... ∅. A maximal by inclusion connected subgraph B of a graph G such that every two edges of B are contained in a cycle of G is called a block of G. A connected graph all of whose blocks are either complete ... either complete graphs or odd cycles is called a Gallai tree,aGallai forest is a graph all of whose connected components are Gallai trees. A k-Gallai forest...

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

... David C Fisher and Anne Spalding, Domination of circulant graphs: an example of min-plus algebra. Proceedings of the Twenty-eighth Southeastern International Conference on Combinatorics, Graph ... examined in further detail. The existence of circulant graphs with domination number greater than 2 is related to a kind of difference set in Z n . 2000 Mathematics Subject Clas...

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

... non-constant fractional linear transformation which maps i to x, j to y and l to z. Others think about Katona’s cyclic permutation method in a different way [18]. Their understanding is that a variant ... variant of the theorem can easily be shown in a special setting, and then a double counting argument transfers the special result to the theorem. We acknowledge that...

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