The coalescence of multi-wheel and starlike graphs is DLS

The Laplacian spectrum of a graph is obtained by taking the difference of the adjacency spectrum from the diagonal matrix of degrees. If a graph has a unique Laplacian spectrum,  it means that  it can be identified by this spectrum, it is called DLS. In this article,  we first introduce the graph resulting from the integration of a starlike tree and a multi-wheel graph at the vertices with the maximum degree of these two graphs. Then, we check whether it is DLS.

کلیدواژه ها:

Laplacian spectrum ، DLS graph ، Coalescence of graphs