Graph spectra
β Scribed by R.J. Faudree; R.J. Gould; M.S. Jacobson; J. Lehel; L.M. Lesniak
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 430 KB
- Volume
- 150
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
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 ~_ [0, 1 ..... (~)} such that S = Sk(G)for some graph G.
π SIMILAR VOLUMES
In this paper we give an account of the different ways to define homomorphisms of graphs. This leads to six classes of endomorphisms for each gt aph. which as sets always form a chain by inclusion. The endomorphism spectrum is defined as a six-tuple containing the cardinalities of these six sets, an
The graphs 1-7, and only these molecular graphs have integral spectra. The proof af this theorem elucidates also several other interesting spectral prope:ties of graphs which represent unsaturated conjugated ampcmnds.