%0 Journal Article
%T 完全图去除路P<sub>10</sub>的图谱特征<br>Spectral Characterization of the Complete Graph by Deleting P<sub>10</sub>
%A 林智浩
%J Pure Mathematics
%P 937-945
%@ 2160-7605
%D 2021
%I Hans Publishing
%R 10.12677/PM.2021.115107
%X <div style=\"text-align:justify;\">
	如果与图G同谱的所有图同构于图G，则称图G是由其图谱所决定的。设K<sub>n</sub>\P<sub>l</sub>是由完全图K<sub>n</sub>去除图P<sub>l</sub>的边所得到的子图，其中图P<sub>l</sub>是长为l？1的路。Cámara和Haemers给出猜想1：对于任意的整数l(2≤l≤n)，K<sub>n</sub>\P<sub>l</sub>可由其邻接谱所决定。本文证明在l=10的情况下猜想1是正确的。<br />
A graph G is said to be determined by its spectrum if any graph having the same spectrum as G is isomorphic to G. Let K<sub>n</sub>\P<sub>l</sub> be the graph obtained from K<sub>n</sub> by deleting edges of P<sub>l</sub>, where P<sub>l</sub> is a path of length l？1. Cámara and Haemers conjectured that K<sub>n</sub>\P<sub>l</sub> is determined by its adjacency spectrum for every (2≤l≤n). In this paper, we show that the conjecture is true for l=10.
</div>
%K 图谱，同谱图，谱特征，路<br>Graph Spectrum
%K Cospectral Graphs
%K Spectral Characterization
%K Path
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=42720