Abstract
In this paper, we give a method to characterize graphs determined by their adjacency spectrum. At first, we give two parameters Π1(G) and Π2(G), which are related to coefficients of the characteristic polynomial of graph G. All connected graphs with Π1(G)∈{1,0,−1,−2,−3} and Π2(G)∈{0,−1,−2,−3} are characterized. Some interesting properties of Π1(G) and Π2(G) are also given. We then find the necessary and sufficient conditions for two classes of graphs to be determined by their adjacency spectrum.
Funder
Natural Science Funds of China
Subject
Geometry and Topology,Logic,Mathematical Physics,Algebra and Number Theory,Analysis
Reference29 articles.
1. Graph Theory;Bondy,2008
2. Almost all trees are cospectral;Schwenk,1973
3. Constructing cospectral graphs
4. Algebra Combination;Godsil,1980
5. The Lollipop Graph is Determined by its Spectrum
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献