A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs
For a distance-regular graph \(\Gamma\) let \(r(\Gamma)=\max\{i\mid (c_i,a_i)=(c_1,a_1)\}\). For two vertices \(u\) and \(x\) with \(d(u,x)=j\) let \(C(u,x)=\Gamma_{j-1}(u)\cap \Gamma(x)\), \(A(u,x)=\Gamma_j(u)\cap \Gamma(x)\) and \(B(u,x)=\Gamma_{j+1}(u)\cap \Gamma(x)\). A subgraph \(\Delta\) is called geodetically closed (strongly closed) if \(C(u,w)\subseteq \Delta\) (if \(C(u,w)\cup A(u,w)\subseteq \Delta\)) for any \(u,w\in \Delta\). We say the condition \((\text{SC})_t\) holds if for any given pair of vertices at distance \(t\) there exists a strongly closed subgraph of diameter \(t\) containing them. Theorem 1.1. Let \(\Gamma\) be a distance-regular graph of diameter \(d\) and \(r=r(\Gamma)\leq d-3\). Then the following conditions are equivalent. (i) \(\Gamma\) is isomorphic to either the doubled Grassmann graph, the doubled Odd graph or the Odd graph. (ii) The conditions \(\text{(SC)}_t\) hold for all \(1\leq t\leq d-1\). Any strongly closed subgraph of diameter \(t\) with \(r+1\leq t\leq d-1\) is a non-regular distance-biregular graph if \(t\) is even, or a bipartite distance-regular graph if \(t\) is odd. (iii) The conditions \((\text{SC})_t\) and \((\text{SC})_{t+1}\) hold for some \(t\) with \(r+1\leq t\leq d-1\). A strongly closed subgraph of diameter \(t\) is a non-regular distance-biregular graph. Theorem 1.2. Let \(\Gamma\) be a distance-regular graph of diameter \(d\) and \(r=r(\Gamma)\). Let \(t\) be an integer with \(r+1\leq t\leq d-1\). Suppose \((c_{t-1},a_{t-1})=(c_t,a_t)\neq (1,1)\) and condition \((\text{SC})_{t+1}\) holds. Then \(\Gamma\) is isomorphic to either the doubled Grassmann graph, the doubled Odd graph or the Odd graph.
- A characterization of some distance-regular graphs by strongly closed subgraphs
- Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\)
- On strongly closed subgraphs of highly regular graphs
- A characterization of the Hamming graphs and the dual polar graphs by completely regular subgraphs
- A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers
- A distance-regular graph with strongly closed subgraphs
- Characterization of projective incidence structures
- Cubic Distance-Regular Graphs
- Distance-regular graphs and (s,c,a,k)-graphs
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- On strongly closed subgraphs of highly regular graphs
- On uniformly geodetic graphs
- The dual of Pasch's axiom
- The nonexistence of certain generalized polygons
- Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\)
- A characterization of some distance-regular graphs by strongly closed subgraphs
- Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\)
- A distance-regular graph with strongly closed subgraphs
- Applications of the retracing method for distance-regular graphs
- A distance-regular graph with bipartite geodetically closed subgraphs.
- A characterization of the Hamming graphs and the dual polar graphs by completely regular subgraphs
- On the automorphism group of doubled Grassmann graphs
- The Terwilliger algebra of the incidence graphs of Johnson geometry. II.
- The Terwilliger algebra of the incidence graphs of Johnson geometry
- On the distance transitivity of the bipartite Kneser graphs
- A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers
- A characterization of the Hamming graph by strongly closed subgraphs
This page was built for publication: A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1867281)
