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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.