Characterizing bipartite distance-regularized graphs with vertices of eccentricity 4

2023/08/17 by Blas Fernández, Fernández, Blas, Marija Maksimović +3 · 1 citation
Biochemistry, Genetics and Molecular Biology · Materials Science · #Combinatorics (math.CO) #FOS: Mathematics #Fibroblast Growth Factor Research #Protein Tyrosine Phosphatases #Synthesis and properties of polymers

paper · pdf · doi:10.48550/arxiv.2308.09011

openalex publication_date 2023/08/17 · openalex created_date 2023/08/22 · openalex updated_date 2026/07/28

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, λ₁,0) of type (k-1,t) with intersection numbers x=0 and y>0, where 0< y≤ t

Cited by

• On 2-Y-homogeneous (Y,Y')-distance-biregular graphs with D=4

Related

• On the metric dimension of incidence graphs
• Some Spectral and Quasi-Spectral Characterizations of Distance-Regular Graphs
• Algebraic characterizations of regularity properties in bipartite graphs
• Almost-bipartite distance-regular graphs with the Q-polynomial\n property
• There exists no distance-regular graph with intersection array\n 56,36,9;1,3,48