Name
Abstract | ||
|---|---|---|
We study the weights of eigenvectors of the Johnson graphs J(n,w). For any i∈{1,…,w}
and sufficiently large n,n≥n(i,w) we show that an eigenvector of J(n,w) with the eigenvalue λi=(n−w−i)(w−i)−i has at least 2in−2iw−i nonzeros and obtain a characterization of eigenvectors that attain the bound. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.disc.2018.04.018 | Discrete Mathematics |
Keywords | Field | DocType |
Johnson scheme,Eigenspace,Support of a function | Discrete mathematics,Graph,Combinatorics,Eigenfunction,Eigenvalues and eigenvectors,Mathematics,Lambda | Journal |
Volume | Issue | ISSN |
341 | 8 | 0012-365X |
Citations | PageRank | References |
2 | 0.44 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Konstantin Vorob'ev | 1 | 2 | 0.44 |
| Ivan Yu. Mogilnykh | 2 | 36 | 8.74 |
| Alexandr Valyuzhenich | 3 | 16 | 3.37 |