Characterizing bipartite distance-regularized graphs with vertices of eccentricity 4
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 (v,b,r,k, λ1,0) of type (k-1,t) with intersection numbers x=0 and y>0, where 0< y≤ t<k , and bipartite distance-regularized graphs with D=D'=4.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.