On graphs without crowns with regular \(\mu\)-subgraphs (Q5942061)

A vertex \(a\) of a graph \(\Gamma\) is called reduced if the set \(\{x\in \Gamma \mid a^\bot=x^\bot\}\) coincides with \(\{a\}\). A graph \(\Gamma\) is called reduced if each of its vertices is reduced. In this paper connected reduced graphs without crowns with 3-coclique and with regular \(\mu\)-subgraphs of the same valency \(\alpha\) for some \(\alpha>0\) are considered. If a graph does not contain 3-claws then it is a triangular graph \(T(m)\) for \(m\geq 6\), or the icosahedron graph, or the Schläfli graph (Theorem 1). If a graph contains a 3-claw then it is locally a \(G\)-graph, where \(G\) is the \(\alpha/2\)-clique extension of the \(m\times n\)-grid, a triangular graph \(T(m)\) for \(m\geq 6\), or the Schläfli graph (Theorem 2). The main result is Theorem 3. Let \(\Gamma\) be a connected reduced graph without crowns with 3-claws and with regular \(\mu\)-subgraphs of diameter 2 and the same valency \(\alpha\) for some \(\alpha>0\). Then \(\Gamma\) is a Grassmann graph, a Johnson graph or its quotient, a locally \(T(m)\)-graph, \(m\geq 6\), or the Gosset graph \(E_7(1)\).