The following pages link to Cubic Distance-Regular Graphs (Q3697043):
Displaying 37 items.
- There are only finitely many distance-regular graphs of fixed valency greater than two (Q475256) (← links)
- Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
- Distance regularity in buildings and structure constants in Hecke algebras (Q527777) (← links)
- Distance-regular graphs with or at least half the valency (Q662028) (← links)
- Distance regular subgraphs of a cube (Q686314) (← links)
- The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\) (Q729793) (← links)
- A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers (Q854827) (← links)
- A characterization of the Hamming graph by strongly closed subgraphs (Q942131) (← links)
- A remark on the intersection arrays of distance-regular graphs (Q1077433) (← links)
- On distance-regular graphs with fixed valency. IV (Q1123215) (← links)
- On symmetric association schemes with \(k_1=3\) (Q1272911) (← links)
- The distance-regular graphs of valency four (Q1296385) (← links)
- A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph (Q1413223) (← links)
- Distance-regular graphs of valency 6 and \(a_1=1\) (Q1575097) (← links)
- Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs (Q1669902) (← links)
- The regular near polygons of order \((s,2)\) (Q1768528) (← links)
- Applications of the retracing method for distance-regular graphs (Q1775035) (← links)
- Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I (Q1825881) (← links)
- Retracing argument for distance-regular graphs (Q1850478) (← links)
- On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7 (Q1864611) (← links)
- A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs (Q1867281) (← links)
- A distance-regular graph with bipartite geodetically closed subgraphs. (Q1873771) (← links)
- On strongly closed subgraphs of highly regular graphs (Q1891370) (← links)
- Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\) (Q1898055) (← links)
- A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph (Q1911238) (← links)
- Geometric distance-regular graphs without 4-claws (Q1932578) (← links)
- Non-bipartite distance-regular graphs with a small smallest eigenvalue (Q2001973) (← links)
- Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue (Q2117517) (← links)
- On bounding the diameter of a distance-regular graph (Q2151185) (← links)
- Distance-regular graphs without 4-claws (Q2311358) (← links)
- The Sylvester graph and Moore graphs (Q2311364) (← links)
- An inequality involving the second largest and smallest eigenvalue of a distance-regular graph (Q2431156) (← links)
- On geometric distance-regular graphs with diameter three (Q2441641) (← links)
- Improving diameter bounds for distance-regular graphs (Q2581461) (← links)
- Classification of partially metric Q-polynomial association schemes with \(m_1=4\) (Q2657076) (← links)
- Spectral determinations and eccentricity matrix of graphs (Q2672953) (← links)
- On regular graphs equienergetic with their complements (Q6160509) (← links)
