paper

Characterizing bipartite distance-regularized graphs with vertices of eccentricity 4

arXiv:2308.09011

Abstract

The characterization of bipartite distance-regularized graphs, where some vertices have eccentricity less than four, in terms of the incidence structures of which they are incidence graphs, is known. In this paper we prove that there is a one-to-one correspondence between the incidence graphs of quasi-symmetric SPBIBDs with parameters of type with intersection numbers and , where , and bipartite distance-regularized graphs with .

Characterizing bipartite distance-regularized graphs with vertices of eccentricity 4 · wovepaper