2025/09/15 by Indranil Mukherjee, Mukherjee, Indranil, Chakraborty, Suvra Kanti +1
Computer Science · Mathematics · #05C50 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.2509.12342
openalex publication_date 2025/09/15 · openalex created_date 2025/10/18 · openalex updated_date 2026/07/28
The T-graph T(G) of a graph G is the graph whose vertices are the vertices and edges of G, with two vertices of T(G) are adjacent if and only if the corresponding elements of G are adjacent or incident. In this paper, we determine the adjacency and Laplacian spectra of T-vertex neighborhood corona and T-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 A-cospectral and L-cospectral graphs.