Name
Abstract | ||
|---|---|---|
The k -spectrum s k ( 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, …,( 2 k )} and consider the more general question of describing those sets S ⊆ {0,1, … ,( 2 k )} such that S = s k ( G ) for some graph G . |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1016/0012-365X(95)00179-Z | Discrete Mathematics |
Keywords | DocType | Volume |
graph spectrum | Journal | 150 |
Issue | ISSN | Citations |
1-3 | Discrete Mathematics | 1 |
PageRank | References | Authors |
0.44 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. J. Faudree | 1 | 174 | 38.15 |
| R. J. Gould | 2 | 23 | 4.92 |
| M. S. Jacobson | 3 | 198 | 40.79 |
| J. Lehel | 4 | 391 | 75.03 |
| L. M. Lesniak | 5 | 44 | 8.23 |