期刊文献+

谱半径为4的整树

The integral trees with index 4
下载PDF
导出
摘要 整图刻画的问题是学术届公认的十分难的问题,本文利用图的特征多项式、谱与图的直径的关系等,刻画了谱半径为4,谱λ?3的所有整树,这样的树有且仅有18种。 Integral graphs are very difficult to be found. In this paper, by the characteristic polynomials and the relations of spectrum and diameter of graph, all integral trees with index 4 and avoiding 3 in the spectral are determined, such trees have only 18 species.
出处 《湖南文理学院学报(自然科学版)》 CAS 2015年第4期8-13,共6页 Journal of Hunan University of Arts and Science(Science and Technology)
基金 湖南师范大学优秀青年项目(ET13101) 湖南省自然科学基金(12JJ6005)
关键词 整图 谱半径 trees integral graph spectral radius
  • 相关文献

参考文献10

  • 1Cvetkovic D, Doob M, Sachs H. Spectra of graphs: Theory and Application [M]. New York: Academic Press, 1995.
  • 2Harary F, Schwenk A. Which graphs have integral spectra? [C]//Bad R, Harary F. Graphs and Combinatorics. Berlin: Springer-Vedag, 1974:45-51.
  • 3Bussemaker F, Cvetkovic D. There are exactly 13 connected cubic, integral graphs [J]. Univ Beograd Publ Elektrotehn Fak Ser Mat, 1976, 552: 43--48.
  • 4Hagos E M. Some results on graph spectra [J]. Lin Alg Appl, 2002, 356:103-111.
  • 5Brouwer A E, Haemers W H. The integral trees with spectral radius 3 [J]. Lin Alg Appl, 2008, 429:2 710-2 718.
  • 6Tang Z K, Hou Y P. The integral graphs with index 3 and exactly two main eigenvalues [J]. Lin Alg Appl, 2010, 433: 984-993.
  • 7Wang L G, Liu X D. Integral complete multipartite graphs [J]. Discrete Mathematics, 2008, 308:3 860-3 870.
  • 8Godsil C D. Spectra of trees [J]. Annals of Discrete Mathematics, 1984, 20:151-159.
  • 9Smith J H. Some properties of the spectrum of a graph [C]//Guy R, Hanani H, Saner N, et al. Combinatorial Structures and Their Applications. New York: Gordon and Breach Science Publ, 1970: 403-406.
  • 10Radosavljevic Z, Simic S. Which bicyclic graphs are reflexive? [J]. Univ Beograd Publ Elektrotehn Fak Ser Mat, 1996, 7: 90-104.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部