The regular near polygons of order \((s,2)\)
From MaRDI portal
Publication:1768528
DOI10.1023/B:JACO.0000047296.94830.e7zbMath1059.05109OpenAlexW2029395680MaRDI QIDQ1768528
Publication date: 15 March 2005
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jaco.0000047296.94830.e7
Association schemes, strongly regular graphs (05E30) Generalized quadrangles and generalized polygons in finite geometry (51E12)
Related Items (2)
Geometric distance-regular graphs without 4-claws ⋮ A characterization of the Hamming graph by strongly closed subgraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On generalized Moore geometries. I, II
- On distance-regular graphs with fixed valency. II
- Distance-biregular graphs with 2-valent vertices and distance regular line graphs
- A remark on the intersection arrays of distance-regular graphs
- Near \(n\)-gons and line systems
- An inequality for generalized hexagons
- Characterization of H(n,q) by the parameters
- Bipartite distance-regular graphs of valency three
- A circuit chasing technique in a distance-regular graph with triangles
- Problems in algebraic combinatorics
- Distance-regular graphs of valency 6 and \(a_1=1\)
- The nonexistence of certain generalized polygons
- Cubic Distance-Regular Graphs
This page was built for publication: The regular near polygons of order \((s,2)\)
