A sufficient condition for a family of graphs being determined by their generalized spectra

2005/06/10 by Wei Wang, Cheng-xian Xu, Chengxian Xu · 5 citations
Computer Science · Mathematics · #Graph theory and applications #Matrix Theory and Algorithms #Topological and Geometric Data Analysis

paper · doi:10.1016/j.ejc.2005.05.004

openalex publication_date 2005/06/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Cited by

• On a generalization of the Johnson-Newman theorem to multiple rank-one perturbations
• Generalized block diagonal Laplacian spectrum of graphs
• A sufficient condition for generalized spectral characterization of graphs with loops
• Almost all graphs have no cospectral mate with fixed level
• Degree-similar graphs and cospectral graphs