The spectrum of a class of graphs derived from Grassmann graphs
Combinatorics
2021-03-12 v1
Abstract
Let be positive integers such that , . Let be a power of a prime and be a finite field of order . Let be a vector space of dimension over . We define the graph as a graph with the vertex set , where and are the family of subspaces in of dimension and respectively, in which two vertices and are adjacent whenever is a subspace of or is a subspace of . It is clear that the graph is a bipartite graph. In this paper, we study some properties of this graph. In particular, we determine the spectrum of the graph .
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}
}