Characterizing bipartite distance-regularized graphs with vertices of eccentricity 4
Combinatorics
2023-08-21 v1
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 .
Keywords
Cite
@article{arxiv.2308.09011,
title = {Characterizing bipartite distance-regularized graphs with vertices of eccentricity 4},
author = {Blas Fernández and Marija Maksimović and Sanja Rukavina},
journal= {arXiv preprint arXiv:2308.09011},
year = {2023}
}