去除一个周期的完整图谱特征

IF 0.9 2区数学 Q2 MATHEMATICS

Journal of Combinatorial Theory Series A Pub Date : 2024-02-09 DOI:10.1016/j.jcta.2024.105868

Muhuo Liu , Xiaofeng Gu , Haiying Shan , Zoran Stanić

引用次数: 0

摘要

如果不存在另一个具有相同频谱的图，则该图由其频谱决定。Cámara 和 Haemers 证明，通过删除具有 k 个顶点的循环 Ck 的所有边，从具有 n 个顶点的完整图 Kn 得到的图 Kn∖Ck，在 k∈{3,4,5} 时由其谱决定，但在 k=6 时则不是。在本文中，我们将证明 k=6 是 Kn∖Ck 的谱确定性的唯一例外。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Spectral characterization of the complete graph removing a cycle

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 $K_{n} ∖ C_{k}$ , obtained from the complete graph $K_{n}$ with n vertices by deleting all edges of a cycle $C_{k}$ with k vertices, is determined by its spectrum for $k \in {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 $K_{n} ∖ C_{k}$ .

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Combinatorial Theory Series A 数学-数学

CiteScore

2.90

自引率

9.10%

发文量

审稿时长

12 months

期刊介绍： The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.