The edge corona of two graphs G and H, denoted by G 0 H, is obtained

by taking one copy of G and |E(G)| copies of H and joining each end vertices

of i-th edge of G to every vertex in the i-th copy of H. In ...

Let G and H be two graphs. The strong product G

H of the graphs

G and H is the graph with vertex set V (G) V (H), and u = (u1; v1) is

adjacent with v = (u2; v2) whenever (v1 = v2 and u1 is adjacent ...

Suppose G1;G2; :::;Gn are connected rooted graphs

with root vertices r1; :::; rn, respectively. The generalized link

(G1; :::;Gn)(k1;:::;kn)

(r1;:::;rn) is obtained by adding a new vertex x, ...

In this paper , we investigate integral graph as a graph whose spectrum of eigenvalues consists Entirely of integers that was introduced by Harary and Schwenk in 1974. The effect of various binary ...

Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u1, v1) is adjacent with v= (u2, v2) whenever (v1 = v2 and u1 is adjacent with u2) or (u1 = u2 and v1 is adjacent ...