Graph spectra
type: Item
instance of: scholarly article
title: Graph spectra
zbMATH Open document ID: 0862.05053
DOI: 10.1016/0012-365X(95)00179-Z
published in: Discrete Mathematics
publication date: 1997-05-19T00:00:00Z
review text: The \(k\)-spectrum of a graph \(G\) is the set of all nonnegative integers that occur as the size of an induced \(k\)-vertex subgraph of \(G\). The authors determine the minimum order and size of a graph whose \(k\)-spectrum contains all the numbers \(0,1, \dots, {k \choose 2}\). They also study the sets that are \(k\)-spectra of some graphs. Reviewer's remark. The title of the paper is a little bit misleading since under the spectrum of a graph a reader would usually understand the spectrum of a matrix associated to the graph in a certain way.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 895991
zbMATH Keywords: spectrum
author: Ralph Faudree
author: Ronald Gould
author: Michael Jacobson
author: Jeno Lehel
author: Linda Lesniak
reviewed by: Dragoš Cvetković
MaRDI profile type: Publication
cites work: Q4871156
cites work: Maximum induced trees in graphs
cites work: The Lattice Point Covering Theorem for Rectangles
description: scientific article; zbMATH DE number 895991