The Electronic Journal of Combinatorics · 2019 · 13 citations · 8 references
ComputingMathematicsComputational GeometrySpectroscopic AnalysisSpectroscopyGeometric GraphsGraph AlgorithmsGraph TheorySpectral AnalysisSpectral MethodsSpectral TheoryAlgebraic Graph TheoryEulerian GraphsSpectral Graph Theory
A graph $G$ is said to be determined by its generalized spectra (DGS for short) if, for any graph $H$, graphs $H$ and $G$ are cospectral with cospectral complements imply that $H$ is isomorphic to $G$. In Wang (J. Combin. Theory, Ser. B, 122 (2017) 438-451), the author gave a simple method for a graph to be DGS. However, the method does not apply to Eulerian graphs. In this paper, we gave a simple method for a large family of Eulerian graphs to be DGS. Numerical experiments are also presented to illustrate the effectiveness of the proposed method.
8
Theory of linear and integer programming
Computers & Mathematics with Applications · 1998 · 1.1K citations
Developments on spectral characterizations of graphs
Edwin van Dam, Willem H. Haemers · Discrete Mathematics · 2008 · 262 citations