On geometric distance-regular graphs with diameter three
From MaRDI portal
Recommendations
Cites work
- A Higman-Haemers inequality for thick regular near polygons
- Cubic Distance-Regular Graphs
- Delsarte clique graphs
- Distance-biregular graphs with 2-valent vertices and distance regular line graphs
- Distance-regular graph with the intersection array \(\{45, 30, 7; 1, 2, 27\}\) does not exist
- Distance-regular graphs
- Distance-regular graphs of valency 6 and a₁=1
- Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\)
- Geometric distance-regular graphs without 4-claws
- scientific article; zbMATH DE number 3739557 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 563236 (Why is no real title available?)
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- There are only finitely many distance-regular graphs of fixed valency greater than two
Cited in
(19)- 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\)
- On the spectral gap and the automorphism group of distance-regular graphs
- On distance-regular graphs with \(c_2 = 2\)
- Distance-regular graphs of diameter 3 without triangles with c₂=2
- Normal quotients of diameter at most two of finite three-geodesic-transitive graphs
- Geometric antipodal distance-regular graphs with a given smallest eigenvalue
- Distance-regular graphs without 4-claws
- Distance-regular graphs of diameter 3 having eigenvalue -1
- Diameter bounds for geometric distance-regular graphs
- Three distance characteristic polynomials of some graphs
- Automorphisms of distance regular graph with intersection array \(\{30,27,24;1,2,10\}\)
- On a distance-regular graph with an intersection array \(\{35,28,6;1,2,30\}\)
- ON DISTANCE–REGULAR GRAPHS OF DIAMETER 3 WITH EIGENVALUE =1
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- On distance-regular graphs of diameter 3 with eigenvalue 0
- Association schemes on triples over few vertices
- Non-geometric distance-regular graphs of diameter at least 3 with smallest eigenvalue at least -3
- On distance-regular graphs with fixed valency. II
- 3-bounded property in a triangle-free distance-regular graph
This page was built for publication: On geometric distance-regular graphs with diameter three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441641)
