Year: 2021
Type: preprint
Abstract: A design graph is a regular bipartite graph in which any two distinct vertices of the same part have the same number of common neighbors. This class of graphs have a close relationship to strongly regular graphs. In this paper, we study the distance eigenvalues of the design graphs. Also, we will explicitly determine the distance eigenvalues of a class of design graphs, and determine the values for which the class is distance integral, that is, its distance eigenvalues are integers.
Source: arXiv (Cornell University)
Author: Mirafzal, S. Morteza
Institution: Lorestan University
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4226203377