Graph spectra
โ
R.J. Faudree; R.J. Gould; M.S. Jacobson; J. Lehel; L.M. Lesniak
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 430 KB
The k-spectrum st(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 s k(G) = {0, 1 ..... (~)} and consider the more general question of describing those sets S ~\_