Báo cáo toán học: "Fractional biclique covers and partitions of graphs" ppsx

... one of the bicliques in B.Thebiclique cover number, bc(G), of a graph G is the minimum number of bicliques in a biclique cover of G.Abiclique partition of a graph G is a collection B of bicliques ... above and the other is K(R G × S H ,S G × R H ). A biclique of G × H which is one of the two bicliques produced from the weak product of a biclique of G and a bicli...

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

... The formulae for the number of occurrences of all of the variable configurations can be expressed in terms of the order v and the number of occurrences of any one of them. In practice it is natural ... set of points by P (C), the number of points by p(C) and the number of blocks by b(C). Two configurations C and D are said to be isomorphic, in symbols C ∼ = D, if p(C)...

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

... rate of convergence of Picard and Mann iterations for a class of Zamfirescu operators in arbitrary Banach spaces. Popescu [28] also used this concept to compare the rate of convergence of Picard and ... con- cept of K-mapping for finding a common fixed point of a finite family of nonexpansive mappings and a solution of an equilibrium problem. Applications of K-mappings f...

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

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

... Algorithms of this sort find application in many areas: hardware and software testing, combinatorial chemistry and the design of pharmaceutical compounds, coding theory and reliability theory, and computational ... objects of O. The root of the tree is the object of O having the minimum size (possibly the empty object). The objects having the same value of the parameter p l...

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

... Stanley and C.H. Yan, Crossings an d nestings of matchings and partitions, Trans. Amer. Math. Soc., 359 (200 7), 1555– 1575. [5] W.Y.C. Chen, J. Qin and C.M. Reidys, Crossings and Nestings of tangled ... Gessel and D. Zeilberger, Random Walk in a Weyl chamber, Proc. Amer. Math. Soc., 115 (1992), 27–31. [9] D. Gra biner and P. Magya r , Random Walks in a Weyl Cha mber and th...

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

... y and u and v are adjacent in H, or u = v and x and y are adjacent in G. For bipartite graphs, Yan and Zhang in [18] studied the enumeration of perfect matchings for these Cartesian product of ... finite set of vertices and E(G) is a set of unordered pairs xy of vertices called edges. We say that the edge xy is incident with x, y and that x, y are adjacent and are cal...

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

... (j, j ⊕ 1) of A n (for 0 ≤ j < 2 n ), each of them contains exactly either one cell of type 1 and one of type 3, or o ne of type 2 and one of type 4, which fulfills t he condition of (H n ). We ... contradiction. • A cell of type 1 is in the same row as a cell of type 4. Denote by i the row index of these two cells of type 1 and 4. Then i + 2 n−1 is the index of...

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

... between u and v in T (G, v) is called an ancestor of u. By Theorem 6.6 of [2], in every DFS tree if w and w ′ are adjacent, then one of them is a ncestor of another. In a graph G, a k-coloring of G ... because of the minimality of the order of C, there is no edge between two vertices of the same color and for each i, 0 ≤ i ≤ k − 1, there is a v i -colorful pa th on C....

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

... known result due to Beck [2] and comes quite close to the upper bound of Chv´atal and Erd˝os [8]. The proof of Theorem 1 is a combination of our basic “thinning” trick and the following Hamiltonicity ... several papers of Beck (c.f. [3]). This paradigm relates positional games to random graphs. The goal of the section is twofold. On the one hand it describes this paradigm, cal...

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