A non-complete geometric distance-regular graph is the point graph of a partial geometry in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for fixed integer $m\geq 2$, there are only finitely many non-geometric distance-regular graphs with smallest eigenvalue at least $-m$, diameter at least three and intersection number $c_2 \geq 2$.
We introduce distance-regular (0,?)-reguli and show that they give rise to (0,?)-geometries with a distance-regular point graph. This generalises the SPG-reguli of Thas [14] and the strongly regular (?,β)-reguli of Hamilton and Mathon [9], which yield semipartial geometries and strongly regular (?,β)-geometries, respectively. We describe two infinite classes of examples, one of which is a generalisation of the well-known semipartial geometry Tn*(B) arising from a Baer subspace PG(n, q) in PG(n, q2).
Background ::: No residual disease (NRD) can be found in the specimen after endoscopic resection (ER) of biopsy-proven gastric neoplasm. This study aimed to evaluate the endoscopic and pathologic characteristics of patients with NRD and identify the cause and long-term prognosis.