Local recognition of non-incident point-hyperplane graphs (Q2387183): Difference between revisions

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.