For an ordinary graph , we compute the eigenvalues and the eigenspaces of the signed line graph , where is obtained from by inserting a negative parallel edge between every pair of adjacent vertices. As an application, we prove that if and share the same vertex degrees, then and share the same spectrum. To the best of our knowledge, this construction does not follow the line of any known construction developed for either graphs or signed graphs. Among the other consequences, we emphasize that is integral (i.e., its spectrum consists entirely of integers), which means that a construction of integral signed graphs has been established simultaneously.
Stanić, Z. (2024). A construction of cospectral signed line graphs. Communications in Combinatorics and Optimization, (), -. doi: 10.22049/cco.2024.30034.2284
MLA
Stanić, Z. . "A construction of cospectral signed line graphs", Communications in Combinatorics and Optimization, , , 2024, -. doi: 10.22049/cco.2024.30034.2284
HARVARD
Stanić, Z. (2024). 'A construction of cospectral signed line graphs', Communications in Combinatorics and Optimization, (), pp. -. doi: 10.22049/cco.2024.30034.2284
CHICAGO
Z. Stanić, "A construction of cospectral signed line graphs," Communications in Combinatorics and Optimization, (2024): -, doi: 10.22049/cco.2024.30034.2284
VANCOUVER
Stanić, Z. A construction of cospectral signed line graphs. Communications in Combinatorics and Optimization, 2024; (): -. doi: 10.22049/cco.2024.30034.2284