On the distance eigenvalues of design graphs
Combinatorics
2022-01-19 v4
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.
Keywords
Cite
@article{arxiv.2111.05239,
title = {On the distance eigenvalues of design graphs},
author = {S. Morteza Mirafzal},
journal= {arXiv preprint arXiv:2111.05239},
year = {2022}
}
Comments
11 pages. arXiv admin note: text overlap with arXiv:2108.05223