Journal of East China Normal University(Natural Sc ›› 2012, Vol. 2012 ›› Issue (1): 84-87.

• Article • Previous Articles     Next Articles

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

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

CLC Number: