完全五部图的S-整图性研究

摘要

By elementary transformation of a matrix, we compute the Seidel polynomial of complete 5-partite graph, and give a necessary and sufficient condition for a complete 5-partite graph to be an S-integral graph. Furthermore, we characterize the Seidel spectra of a complete regular 5-partite graph and two classes of complete 5-partite graphs with special structure, respectively.%应用矩阵的初等变换得到了完全五部图的 Seidel 多项式，并给出了完全五部图是S-整图的一个充分必要条件。进一步刻画了完全正则五部图和两类特殊完全五部图的Seidel谱。