Title of article
Graph spectra Original Research Article
Author/Authors
R.J. Faudree، نويسنده , , R.J. Gould، نويسنده , , M.S. Jacobson، نويسنده , , J. Lehel، نويسنده , , L.M. Lesniak، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
11
From page
103
To page
113
Abstract
The k-spectrum sk(G) of a graph G is the set of all positive integers that occur as the size of an induced k-vertex subgraph of G. In this paper we determine the minimum order and size of a graph G with sk (G) = {0, 1, …,(2k)} and consider the more general question of describing those sets S ⊆ {0,1, … ,(2k)} such that S = sk(G) for some graph G.
Journal title
Discrete Mathematics
Serial Year
1996
Journal title
Discrete Mathematics
Record number
943709
Link To Document