An infinite family of locally X graphs based on incidence geometries
classification
🧮 math.CO
math.GR
keywords
graphsincidencelocallyfamilygammageometriesgraphinfinite
read the original abstract
A graph ${\mathcal G}$ is locally X if the graphs induced on the neighbours of every vertex of ${\mathcal G}$ are isomorphic to the graph $X$. We prove that the infinite family of incidence graphs of the $r$-rank incidence geometries, $\Gamma(KG(n,k),r)$, constructed using the Kneser graphs $KG(n,k)$, are locally $X$ with $X$ being the incidence graphs of the rank $r-1$ residues of $\Gamma(KG(n,k),r)$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.