On distance and distance Laplacian spectra of corona of two graphs (Q2798319)

Let \(G\) be a graph with \(n\) vertices. The corona of graphs \(G\) and \(H\) is obtained by taking the union of \(G\) and \(n\) copies of \(H\), and by joining the \(i\)-th vertex of \(G\) with each vertex of the \(i\)-th copy of \(H\) for \(i=1,\dots,n\).NEWLINENEWLINEThe transmission of a vertex of a graph is the sum of distances from that vertex to all other vertices of the graph. The graph is transmission-regular if each vertex has the same transmission. The distance Laplacian matrix of a graph is obtained by putting transmissions of vertices as its diagonal entries, and minus distances between pairs of different vertices as the off-diagonal entries.NEWLINENEWLINEThe author describes the spectra of distance and distance Laplacian matrices of corona of graphs \(G\) and \(H\), in cases when \(G\) is transmission-regular and \(H\) is either regular or transmission-regular with diameter at most two. Spectra are described by providing the full set of orthonormal eigenvectors for the respective matrices. It is shown, as a corollary, that using corona one can construct pairs of graphs with the same distance or distance Laplacian spectrum.