Minimum supports of eigenfunctions of Johnson graphs

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 2i(n-2iw-i) nonzeros and obtain a characterization of eigenvectors that attain the bound.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…