华东师范大学学报(自然科学版) ›› 2012, Vol. 2012 ›› Issue (1): 84-87.

• 应用数学与基础数学 • 上一篇    下一篇

完全图的两类生成子图是谱唯一确定的

WU Ting-zeng, HU Sheng-biao   

  1. School of Mathematics and Statistics, Qinghai Nationalities University, Xining 810007,  China
  • 收稿日期:2010-10-01 修回日期:2011-01-01 出版日期:2012-01-25 发布日期:2012-01-26

A graph \emph{G} is said to be \emph{determined by its spectrum} if any graph having the same spectrum as that of \emph{G} is isomorphic to \emph{G}. In this paper, it was proved that $K_{n}-E(lP_{2}) $ and $K_{n}-E(K_{1,l})$ are determined by their spectra, respectively.

青海民族大学 数学与统计学院, 西宁 810007   

  1. School of Mathematics and Statistics, Qinghai Nationalities University, Xining 810007,  China
  • Received:2010-10-01 Revised:2011-01-01 Online:2012-01-25 Published:2012-01-26

PDF

2163

摘要： 只有与 G 同构的图才有相同的谱, 则称图 G 称为谱唯一确定的. 本文证明了, $K_{n}-E(lP_{2})$ 和 $K_{n}-E(K_{1,l})$ 是谱唯一确定的.

Abstract: A graph \emph{G} is said to be \emph{determined by its spectrum} if any graph having the same spectrum as that of \emph{G} is isomorphic to \emph{G}. In this paper, it was proved that $K_{n}-E(lP_{2}) $ and $K_{n}-E(K_{1,l})$ are determined by their spectra, respectively.

Key words: cospectral graphs, spectrum of a graph, eigenvalues

中图分类号: