Local recognition of non-incident point-hyperplane graphs
This article deals with the problem of local recognition of graphs in particular point hyperplanes. Let \(\Delta\) be a graph and try to find all connected graphs \(\Gamma\) whose induced subgraph on the set of all neighbours of an arbitrary vertex of \(\Gamma\) is isomorphic to \(\Delta\). Let \(P\) be a projective space. \(H(P)\) denote the graph whose vertices are the non-incident point-hyperplane pairs of \(P\). Two vertices \((p,H)\) and \((q,I)\) be adjacent if and only if \(p \in I\) and \(q \in H\). The main result of the article characterizes the graph \(H(P)\) by its local structure.
- On the hyperbolic symplectic geometry.
- Local recognition of the line graph of an anisotropic vector space
- scientific article; zbMATH DE number 66117 (Why is no real title available?)
- The local recognition of reflection graphs of spherical Coxeter groups
- Four relations on the set of point-hyperplane anti-flags
- On the hyperbolic unitary geometry
This page was built for publication: Local recognition of non-incident point-hyperplane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387183)