English

The spectrum of a class of graphs derived from Grassmann graphs

Combinatorics 2021-03-12 v1

Abstract

Let n,kn,k be positive integers such that n3n\geq 3, k<n2k < \frac {n}{2} . Let qq be a power of a prime pp and Fq\mathbb{F}_q be a finite field of order qq. Let V(q,n)V(q,n) be a vector space of dimension nn over Fq\mathbb{F}_q. We define the graph S(q,n,k)S(q,n,k) as a graph with the vertex set V=VkVk+1V=V_k \cup V_{k+1}, where VkV_k and Vk+1V_{k+1} are the family of subspaces in V(q,n)V(q,n) of dimension kk and k+1k+1 respectively, in which two vertices vv and ww are adjacent whenever vv is a subspace of ww or ww is a subspace of vv. It is clear that the graph S(q,n,k)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)S(q,n,k).

Keywords

Cite

@article{arxiv.2103.06692,
  title  = {The spectrum of a class of graphs derived from Grassmann graphs},
  author = {S. Morteza Mirafzal and Roya Kogani},
  journal= {arXiv preprint arXiv:2103.06692},
  year   = {2021}
}