Spectral characterization of the complete graph removing a cycle

被引:1
作者
Liu, Muhuo [1 ]
Gu, Xiaofeng [2 ]
Shan, Haiying [3 ]
Stanic, Zoran [4 ]
机构
[1] South China Agr Univ, Dept Math, Guangzhou 510642, Peoples R China
[2] Univ West Georgia, Dept Comp & Math, Carrollton, GA 30118 USA
[3] Tongji Univ, Sch Math Sci, Key Lab Intelligent Comp & Applicat, Minist Educ, Shanghai 200092, Peoples R China
[4] Univ Belgrade, Fac Math, Belgrade 11000, Serbia
基金
中国国家自然科学基金;
关键词
Adjacency matrix; Spectral determination; Complete graph; Cycle; Unicyclic graph; Tree; 2ND LARGEST EIGENVALUE; PATH;
D O I
10.1016/j.jcta.2024.105868
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A graph is determined by its spectrum if there is not another graph with the same spectrum. Camara and Haemers proved that the graph Kn \ Ck, obtained from the complete graph Kn with n vertices by deleting all edges of a cycle Ck with k vertices, is determined by its spectrum for k is an element of {3, 4, 5}, but not for k = 6. In this paper, we show that k = 6 is the unique exception for the spectral determination of Kn \ Ck. (c) 2024 Elsevier Inc. All rights reserved.
引用
收藏
页数:46
相关论文
共 29 条