In this paper, we define duplication corona, duplication neighborhood corona and duplication edge corona of two graphs. We compute their adjacency spectrum, Laplacian spectrum and signless Laplacian. As an application, our results enable us to construct infinitely many pairs of cospectral graphs and also integral graphs.
Rights and permissions | |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |