## Spectra of New Join of Two Graphs

**Authors:** Renny P Varghese, K Rejikumar

Let G1 and G2 be two graph with vertex sets V (G1); V (G2) and
edge sets E(G1);E(G2) respectively. The subdivision graph S(G) of a graph
G is the graph obtained by inserting a new vertex into every edges of G. The
SGvertexjoin of G1 and G2 is denoted by G1}G2 and is the graph obtained
from S(G1) [ G1 and G2 by joining every vertex of V (G1) to every vertex
of V (G2). In this paper we determine the adjacency spectra ( respectively
Laplacian spectra and signless Laplacian spectra) of G1}G2 for a regular graph
G1 and an arbitrary graph G2

**Comments:** 8 Pages.

**Download:** **PDF**

### Submission history

[v1] 2016-10-04 21:54:55

**Unique-IP document downloads:** 35 times

**Add your own feedback and questions here:**

*You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.*

*
*