On Spectra Of Variants Of The Corona Of Two Graphs And Some New Equienergetic Graphs
- Adiga Chandrashekar
- Rakshith B.R.
DOIAbstract
Let G and H be two graphs. The join G ∨ H is the graph obtained by joining every vertex of G with every vertex of H. The corona G ○ H is the graph obtained by taking one copy of G and |V (G)| copies of H and joining the i-th vertex of G to every vertex in the i-th copy of H. The neighborhood corona G★H is the graph obtained by taking one copy of G and |V (G)| copies of H and joining the neighbors of the i-th vertex of G to every vertex in the i-th copy of H. The edge corona G ◇ H is the graph obtained by taking one copy of G and |E(G)| copies of H and joining each terminal vertex of i-th edge of G to every vertex in the i-th copy of H. Let G1, G2, G3 and G4 be regular graphs with disjoint vertex sets. In this paper we compute the spectrum o...
Add to ORKG