A characterization of Grassmann and Johnson graphs
From MaRDI portal
Recommendations
Cites work
- A characterization of some graphs which do not contain 3-claws
- Extending symmetric designs
- scientific article; zbMATH DE number 3349863 (Why is no real title available?)
- Locally 4-by-4 grid graphs
- On a characterization of a class of the regular graphs of diameter 2
- On a theorem of Cooperstein
- On the graphical characterization of the projective space over a finite field
Cited in
(16)- Characterization theorems for Zara graphs
- A characterization of triangular and lattice graphs
- A characterization of some graphs which do not contain 3-claws
- A unified approach to a characterization of Grassmann graphs and bilinear forms graphs
- Distances and diameters on iterated clique graphs
- A characterization of Grassmann graphs
- Treewidth of the generalized Kneser graphs
- On locally Grassmann graphs
- On bijections that preserve complementarity of subspaces
- scientific article; zbMATH DE number 6602525 (Why is no real title available?)
- Locally 4-by-4 grid graphs
- On graphs without crowns with regular \(\mu\)-subgraphs
- On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme
- Treewidth of the \(q\)-Kneser graphs
- A characterization of the Grassmann graphs
- Base subsets of Grassmannians: infinite dimensional case
This page was built for publication: A characterization of Grassmann and Johnson graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813900)