Generalized communicating P systems (GCPSs) are purely communicating tissue-like membrane systems with rules for moving pairs of objects. Despite their simplicity, these systems are rather powerful, they are able to generate any recursively enumerable set of numbers even having restricted variants of communication rules. In this paper we show that GCPSs still remain computationally complete if ...

In this paper, a method for calculating blocking experienced by dynamic multicast connections in a single link is presented. An originating o ce provides a number of channels distributed to the users by multicast subtrees which evolve dynamically as users join and leave the channels. We reduce this problem to a generalized Engset system with unidentical users and generally distributed holding t...

Introducing a new hobby for other people may inspire them to join with you. Reading, as one of mutual hobby, is considered as the very easy hobby to do. But, many people are not interested in this hobby. Why? Boring is the reason of why. However, this feel actually can deal with the book and time of you reading. Yeah, one that we will refer to break the boredom in reading is choosing generalize...

In this paper, the edge a-Zagreb indices and its coindices of some graph operations, such as generalized hierarchical product, Cartesian Product, join, composition of two graphs are obtained. Using the results obtained here, we deduce the F -indices and its coindices for the above graph operation. Finally, we have computed the edge a-Zagreb Index, F -index and their coindices of some important ...

We establish the asymptotic expansion of certain integrals of ψ classes on moduli spaces of curves Mg,n when either the g or n goes to infinity. Our main tools are cut-join type recursion formulae from the WittenKontsevich theorem as well as asymptotics of solutions to the first Painlevé equation. We also raise a conjecture on large genus asymptotics for n-point functions of ψ classes and parti...

Quasi-trees generalize trees in that the unique “path” between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound of the rank-widths of its finite induced subgraphs. Join-trees are the corresponding directed trees. They are useful to define the modular decomposition of a...

Let H,K be two finitely generated subgroups of a free group, let 〈H,K〉 denote the subgroup generated by H,K, called the join of H,K, and let neither of H, K have finite index in 〈H,K〉. We prove the existence of an epimorphism ζ : 〈H,K〉 → F2, where F2 is a free group of rank 2, such that the restriction of ζ on both H and K is injective and the restriction ζ0 : H ∩K → ζ(H)∩ ζ(K) of ζ on H ∩K to ...