Abstract. Given two graphs G1, with vertices 1, 2, ..., n and edges e1, e2, ..., em, and G2, the edge corona G1 ⋄G2 of G1 and G2 is defined as the graph obtained by taking m copies of G2 and for each edge ek = ij of G, joining edges between the two end-vertices i, j of ek and each vertex of the k-copy of G2. In this paper, the adjacency spectrum and Laplacian spectrum of G1 ⋄ G2 are given in te...

Intercellular adhesion is assumed to play an important role in a multitude of biological phenomena governing cellular behavior. The rate of intercellular adhesion as a function of the cell cycle traverse has been investigated using, in the monolayer assay, synchronized Chinese Hamster Ovary-K1 cells. Results obtained demonstrate that cells in G1 adhere to G1 cells at twice the rate that S cells...

Let G = G1 ∪ G2 be the sum of two simple graphs G1, G2 having a common edge or G = G1 ∪ e1 ∪ e2 ∪ G2 be the sum of two simple disjoint graphs G1, G2 connected by two edges e1 and e2 which form a cycle C4 inside G. We give a method of computing the determinant detA(G) of the adjacency matrix of G by reducing the calculation of the determinant to certain subgraphs of G1 and G2. To show the scope ...

The YWRL’s revocable KP-ABE scheme [1] is based on the GPSW KP-ABE scheme [2]. There are eight algorithms in total, where the first four are the same with those in the GPSW scheme. Setup(1). This algorithm takes as input a security parameter κ and an attribute universe U = 1, 2, ..., N . It defines two multiplicative cyclic groups G1 and GT with prime order p, g1 as a generator of G1, and an ad...