加载中…
The -graph of a graph is the graph whose vertices are the vertices and edges of , with two vertices of are adjacent if and only if the corresponding elements of are adjacent or incident. In this paper, we determine the adjacency and Laplacian spectra of -vertex neighborhood corona and -edge neighborhood corona of a connected regular graph with an arbitrary regular graph in terms of their eigenvalues. Moreover, applying these results we construct some non-regular -cospectral and -cospectral graphs.

生成讲解博客的中文版本

生成AI智能校验的中文版本