A P2P system based on super-peer overlay shows good features of combining both advantages of hybrid and pure P2P systems. Most P2P applications being developed are based on the overlay networks composed of super-peers. Super-peer is a special peer acting as a server to a cluster of client peers. Selecting super-peers and constructing a super-peer overlay for clustering client peers are importan...

Let $G$ be a graph with $p$ vertices and $q$ edges. The graph $G$ is said to be a super pair sum labeling if there exists a bijection $f$ from $V(G)cup E(G)$ to ${0, pm 1, pm2, dots, pm (frac{p+q-1}{2})}$ when $p+q$ is odd and from $V(G)cup E(G)$ to ${pm 1, pm 2, dots, pm (frac{p+q}{2})}$ when $p+q$ is even such that $f(uv)=f(u)+f(v).$ A graph that admits a super pair sum labeling is called a {...

Co-processed excipients may enhance functionality and reduce drawbacks of traditional for the manufacture tablets on a commercial scale. The following study aimed to characterize range co-processed that prove suitable dispersible tablet formulations prepared by direct compression. dosage form is used most tablets. Their accessibility, simplicity administration, consistency, affordability are ad...

this article will address the extension of super efficiency method to rank the non-extreme efficient decision making units. many methodologies have introduced methods that can rank efficient units, amongst which, the super efficiency method due to its ability to provide meaningful geometrical as well as economic analyses has a significant place. but the common problem with all the super efficie...

Let G = (V,E) be a connected graph. G is said to be super edge connected (or super-k for short) if every minimum edge cut of G isolates one of the vertex of G. A graph G is called m-super-k if for any edge set S # E(G) with jSj 6m, G S is still super-k. The maximum cardinality of m-super-k is called the edge fault tolerance of super edge connectivity of G. In this paper, we discuss the edge fau...