We study generating functions for the number of involutions of length n avoiding (or containing exactly once) 132 and avoiding (or containing exactly once) an arbitrary permutation τ of length k. In several interesting cases these generating functions depend only on k and can be expressed via Chebyshev polynomials of the second kind. In particular, we show that involutions of length n avoiding ...

The biclique cover number (resp. biclique partition number) of a graph G, bc(G) (resp. bp(G)), is the least number of bicliques—complete bipartite subgraphs—that are needed to cover (resp. partition) the edges of G. The local biclique cover number (resp. local biclique partition number) of a graph G, lbc(G) (resp. lbp(G)), is the least r such that there is a cover (resp. partition) of the edges...

‎in this paper we give a characterization for all commutative‎ ‎rings with $1$ whose zero-divisor graphs are $c_4$-free.‎

the zarankiewicz number z(b; s) is the maximum size of a subgraph of kb,b which does not contain ks,s as a subgraph. the two-color bipartite ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of kb,b with two colors contains a ks,s in the rst color or a kt,t in the second color.in this work, we design and exploit a computational method for bounding and computin...

We quantify the notion of pattern and formalize the process of pattern discovery under the framework of binary bipartite networks. Patterns of particular focus are interrelated global interactions between clusters on its row and column axes. A binary bipartite network is built into a thermodynamic system embracing all up-and-down spin configurations defined by product-permutations on rows and c...

Motivation: In this paper we present an immune model with bipartite graphs theory. We collect data through COPE database and construct an immune cytokine network. The act degree distribution of this network is proved to be power-law,with index of 1.8. The network is scale-free, with assortativity of –0.27 and similarity of 0.13. The results show that this model could describe the cytokine-cytok...

3 Minimum cost network flow problem 5 3.1 Transportation problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 The maximum flow problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.3 The shortest path problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.4 The single source shortest paths . . . . . . . . . . . . . . . . ...

3 Minimum cost network flow problem 5 3.1 Transportation problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 The maximum flow problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.3 The shortest path problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.4 The single source shortest paths . . . . . . . . . . . . . . . . ...

Abstract In the loop quantum gravity framework, spin network states carry entanglement between excitations of geometry at different space points. This intertwiner is gauge-invariant and comes from superposition spins intertwiners. Bipartite can be interpreted as a witness distance, while multipartite reflects curvature geometry. The present work investigates how bipartite changes under action h...

The distribution of the number of links per species, or degree distribution, is widely used as a summary of the topology of complex networks. Degree distributions have been studied in a range of ecological networks, including both mutualistic bipartite networks of plants and pollinators or seed dispersers and antagonistic bipartite networks of plants and their consumers. The shape of a degree d...