3 papers
math.CO2026
A New Sufficient Condition for Oriented Graphs Determined by Their Generalized Skew Spectra
Limeng Lin, Wei Wang, Hao Zhang
Characterizing graphs uniquely determined by their spectra (DS) is a core open problem in spectral graph theory. While this problem has been extensively investigated for simple und…
math.CO2026
A Family of Simultaneously Cospectral Trees for Degree-Distance Matrices
Limeng Lin, Quanyu Tang, Kehua Wang +1
Spectral characterization of graphs for various graph matrices constitutes a central topic in spectral graph theory. Let be a graph with adjacency matrix , diagonal degre…
math.CO2025
An Upper Bound on the Number of Generalized Cospectral Mates of Oriented Graphs
Limeng Lin, Wei Wang, Hao Zhang
This paper examines the spectral characterizations of oriented graphs. Let be an -vertex oriented graph with skew-adjacency matrix . Previous research mainly focused on s…