A characterization of Grassmann and Johnson graphs

DOI10.1016/0095-8956(90)90116-HzbMath0743.05067MaRDI QIDQ1813900

Minoru Numata

Publication date: 25 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

Johnson graphsGrassmann graphsGosset graphsSchläfli graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (8)

Treewidth of the generalized Kneser graphs ⋮ Base subsets of Grassmannians: infinite dimensional case ⋮ Treewidth of the \(q\)-Kneser graphs ⋮ On graphs without crowns with regular \(\mu\)-subgraphs ⋮ Distances and diameters on iterated clique graphs ⋮ A characterization of triangular and lattice graphs ⋮ On bijections that preserve complementarity of subspaces ⋮ A characterization of some graphs which do not contain 3-claws

Cites Work

• Unnamed Item
• On a theorem of Cooperstein
• On the graphical characterization of the projective space over a finite field
• A characterization of some graphs which do not contain 3-claws
• On a characterization of a class of the regular graphs of diameter 2
• Extending symmetric designs
• Locally 4-by-4 grid graphs

This page was built for publication: A characterization of Grassmann and Johnson graphs