The signless Laplacian spectra of the corona and edge corona of two graphs

59 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Spectra of graph operations based on R-graph (2015, methodology): “For an r -regular graph G with n vertices, we have γ1(G) = 2r and by (1) that Q(G)(x) = n x−2r (see also [12]).”
Spectra of the neighbourhood corona of two graphs (2012, background): “Similarly, the A-spectrum, L-spectrum and Q-spectrum of the edge corona [9] of two graphs, which is a variant of the corona operation, were completely computed in [6,8,9].”
Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae (2012, methodology): “Until now, many graph operations such as the disjoint union, the Cartesian product, the Kronecker product, the corona, the edge corona and the neighborhood corona have been introduced, and their spectra are computed in [2–5, 8, 10, 16, 17], respectively.”