当前位置: X-MOL 学术J. Comb. Theory A › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Spectral characterization of the complete graph removing a cycle
Journal of Combinatorial Theory Series A ( IF 1.1 ) Pub Date : 2024-02-09 , DOI: 10.1016/j.jcta.2024.105868
Muhuo Liu , Xiaofeng Gu , Haiying Shan , Zoran Stanić

A graph is determined by its spectrum if there is not another graph with the same spectrum. Cámara and Haemers proved that the graph , obtained from the complete graph with vertices by deleting all edges of a cycle with vertices, is determined by its spectrum for , but not for . In this paper, we show that is the unique exception for the spectral determination of .

中文翻译:

去除循环的完整图的光谱表征

如果不存在具有相同频谱的其他图,则图由其频谱确定。Cámara 和 Haemers 证明,通过删除具有顶点的环的所有边而从具有顶点的完整图获得的图 是由 的谱决定的,但不是由 的谱决定的。在本文中,我们证明这是光谱测定的独特例外。
更新日期:2024-02-09
down
wechat
bug