The spectrum of a class of graphs derived from Grassmann graphs

Abstract

Let n,k be positive integers such that n≥ 3, k < n2 . Let q be a power of a prime p and Fq be a finite field of order q. Let V(q,n) be a vector space of dimension n over Fq. We define the graph S(q,n,k) as a graph with the vertex set V=Vk Vk+1, where Vk and Vk+1 are the family of subspaces in V(q,n) of dimension k and k+1 respectively, in which two vertices v and w are adjacent whenever v is a subspace of w or w is a subspace of v. It is clear that the graph S(q,n,k) is a bipartite graph. In this paper, we study some properties of this graph. In particular, we determine the spectrum of the graph S(q,n,k).

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…