Combinatorial aspects of block designs (05B05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75) Association schemes, strongly regular graphs (05E30) Synthetic treatment of fundamental manifolds in projective geometries (Grassmannians, Veronesians and their generalizations) (51M35)
Recommendations
- A characterization of Grassmann graphs
- A characterization of Grassmann and Johnson graphs
- A unified approach to a characterization of Grassmann graphs and bilinear forms graphs
- Thin distance-regular graphs with classical parameters \((D, q, q, \frac{q^t-1}{q-1}-1)\) with \(t> D\) are the Grassmann graphs
- Some properties of the twisted Grassmann graphs
Cites work
- A characteristic property of the Grassmann manifold representing the lines of a projective space
- A characterization of Grassmann graphs
- A characterization of some geometries of Lie type
- A characterization of the association schemes of bilinear forms
- A characterization of the association schemes of Hermitian forms
- A characterization of the graphs of bilinear \((d\times d)\)-forms over \(\mathbb{F}_2\)
- A new family of distance-regular graphs with unbounded diameter
- A remark on Grassmann spaces and half-spin geometries
- A spectral characterization of the \(s\)-clique extension of the square grid graphs
- Algebraic combinatorics. Translated from the Japanese
- An application of Hoffman graphs for spectral characterizations of graphs
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Characerization of a class of distance regular graphs.
- Characterization of H(n,q) by the parameters
- Characterization of projective graphs
- Characterization of projective incidence structures
- Characterization of the folded Johnson graphs of small diameter by their intersection arrays
- Characterizing geometric designs. II.
- Distance-regular graphs
- Exceptional graphs with smallest eigenvalue -2 and related problems
- Extremal 1-codes in distance-regular graphs of diameter 3
- Godsil-McKay switching and twisted Grassmann graphs
- Grassmann spaces
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 4054444 (Why is no real title available?)
- scientific article; zbMATH DE number 3736500 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- scientific article; zbMATH DE number 3102314 (Why is no real title available?)
- Improvement of Bruck's completion theorem
- Kite-free distance-regular graphs
- On a Characterization of Grassmann Space Representing the h-Dimensional Subspaces in a Projective Space
- On a theorem of Cooperstein
- On the characterization of the folded halved cubes by their intersection arrays
- On the characterization of the folded Johnson graphs and the folded halved cubes by their intersection arrays
- On the graphical characterization of the projective space over a finite field
- On the Polynomial of a Graph
- Regular graphs with four eigenvalues
- Some Geometries Associated with Parabolic Representations of Groups of Lie Type
- Some properties of the twisted Grassmann graphs
- Spectra of graphs
- Strongly regular graphs having strongly regular subconstituents
- Sur une classe remarquable d'espaces de Riemann. I.
- The association schemes of dual polar spaces of type \(^ 2A_{2d- 1}(p^ f)\) are characterized by their parameters if \(d\geq 3\)
- The dual of Pasch's axiom
- The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
- The spectra of the local graphs of the twisted Grassmann graphs
- The structure of near polygons with quads
- The subconstituent algebra of an association scheme. I
- The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs
- The twisted Grassmann graph is the block graph of a design
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
- Triple intersection numbers of Q-polynomial distance-regular graphs
- Twice Q-polynomial distance-regular graphs
- Two remarks on Huang's characterization of the bilinear forms graphs
- Two-point homogeneous spaces
- Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
- Using symbolic computation to prove nonexistence of distance-regular graphs
Cited in
(5)- Using a Grassmann graph to recover the underlying projective geometry
- A characterization of the Grassmann graphs: one missing case
- Local recognition of the point graphs of some Lie incidence geometries
- Every \(Q\)-polynomial distance-regular graph is sharp over \(\mathbb{R}\)
- Bounding the parameter of a distance-regular graph with classical parameters
This page was built for publication: A characterization of the Grassmann graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661599)
