Characterization theorems for Zara graphs
A Zara graph is a finite graph satisfying the following two properties. i) There is a constant m s.t. every maximal clique has size m. ii) There is a constant e s.t. for every maximal clique M and every vertex x not in M, x is adjacent to e vertices in M. Zara graphs have a rich geometrical structure and it is conceivable that they can be completely classified. In this paper several classifications for subclasses of Zara graphs are given. In particular attention is focused on Zara graphs for which the geometric lattice on a maximal clique is the truncation of a Boolean lattice (these are completely classified if the rank is at least 6), and on Zara graphs for which the partial linear space on the maximal cliques is a near polygon. Finally the non-existence is shown of two Zara graphs which are related to completely regular two-graphs.
- A class of graphs containing the polar spaces
- Buildings of spherical type and finite BN-pairs
- Completely regular twographs
- Dual polar spaces
- Finite regular locally projective spaces
- Graphes liés aux espaces polaires
- scientific article; zbMATH DE number 3882478 (Why is no real title available?)
- scientific article; zbMATH DE number 3884175 (Why is no real title available?)
- scientific article; zbMATH DE number 3739557 (Why is no real title available?)
- scientific article; zbMATH DE number 3496191 (Why is no real title available?)
- scientific article; zbMATH DE number 493057 (Why is no real title available?)
- Locally 4‐by‐4 grid graphs
- Near n-gons and line systems
- On the Uniqueness of the Triangular Association Scheme
- The regular two-graph on 276 vertices
- The structure of near polygons with quads
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
This page was built for publication: Characterization theorems for Zara graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123911)