A remark on the intersection arrays of distance-regular graphs
From MaRDI portal
(Redirected from Publication:1077433)
It is shown that the number of columns of type (1,1,k-2) in the intersection array of a distance-regular graph with valency k and girth \(<3\) is at most four.
Cites work
Cited in
(23)- An inequality between intersection numbers of a distance-regular graph
- On local structure of a distance-regular graph of Hamming type
- On distance-regular graphs with fixed valency. IV
- A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameter \(d=3i -1\) with \(b_ i =1\) and \(k>2\)
- The distance-regular graphs of valency four
- An improvement of the Ivanov bound
- An application of intersection diagrams of high rank
- On distance-biregular graphs of girth divisible by four
- A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph
- Distance-regular graphs of valency 6 and a₁=1
- The regular near polygons of order \((s,2)\)
- Applications of the retracing method for distance-regular graphs
- Retracing argument for distance-regular graphs
- On strongly closed subgraphs of highly regular graphs
- Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\)
- Distance-regular subgraphs in a distance-regular graph. I
- Distance-regular subgraphs in a distance-regular graph. II
- On distance-regular graphs with height two
- On distance-regular graphs with \(k_ i= k_ j\). II
- A remark on Mulder's conjecture about interval-regular graphs
- A constant bound on the number of columns (1,k-2,1) in the intersection array of a distance-regular graph
- Distance-regular graphs of Hamming type
- Intersection diagrams of distance-biregular graphs
This page was built for publication: A remark on the intersection arrays of distance-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077433)
