直径为4的整树新类

计算机工程与应用 ›› 2016, Vol. 52 ›› Issue (10): 15-18.

直径为4的整树新类

张政

西安航空学院理学院，西安 710077

出版日期:2016-05-15 发布日期:2016-05-16

Some new families of integral trees of diameter four

ZHANG Zheng

School of Science, Xi’an Aeronautical University, Xi’an 710077, China

Online:2016-05-15 Published:2016-05-16

摘要/Abstract

摘要： 整图是指图的邻接矩阵的特征值全为整数的图。研究了直径为4的整树。通过求某些特定的丢番图方程，构造了具有无穷多个这样的整树新类。

null

关键词: 整树, 特征多项式, 丢番图方程, 图的谱

Abstract: An integral graph is a graph which all the eigenvalues of its adjacency matrix are integers. This paper investigates integral trees of diameter 4. Many new classes of such integral trees are constructed infinitely by solving some certain Diophantine equations.

Key words: integral trees, characteristic polynomial, diophantine equation, graph spectrum

张政. 直径为4的整树新类[J]. 计算机工程与应用, 2016, 52(10): 15-18.

ZHANG Zheng. Some new families of integral trees of diameter four[J]. Computer Engineering and Applications, 2016, 52(10): 15-18.

[1]	杭后俊，高可飞，李汪根. 椭圆抛物面/球面求交算法[J]. 计算机工程与应用, 2011, 47(33): 180-184.
[2]	张云^1,2,贾磊¹,刘红波¹. NMPS基于DCS的预测PID控制器鲁棒稳定性分析[J]. 计算机工程与应用, 2007, 43(32): 192-195.