Twice Q-polynomial distance-regular graphs of diameter 4

It is known that a distance-regular graph with valency k at least three admits at most two Qpolynomial structures. We show that all distance-regular graphs with diameter four and valency at least three admitting two Q-polynomial structures are either dual bipartite or almost dual bipartite. By the work of Dickie(1995) this implies that any distance-regular graph with diameter d at least four and valency at least three admitting two Q-polynomial structures is, provided it is not a Hadamard graph, either the cube H(d, 2)with d even, the half cube 1/2H(2d + 1, 2), the folded cube?H(2d + 1, 2), or the dual polar graph on [2A2d-1(q)]with q 2 a prime power.     

On a Conjecture of Bannai and Ito: There are Finitely Many Distance-regular Graphs with Degree 5, 6 or 7

Bannai and Ito conjectured in a 1987 paper that there are finitely many distance-regular graphs with fixed degree that is greater than two. In a series of papers they showed that their conjecture held for distance-regular graphs with degrees 3 or 4. In this paper we prove that the Bannai–Ito conjecture holds for degrees 5–7.     

1-Homogeneous Graphs with Cocktail Party μ-Graphs

Let be a graph with diameter d 2. Recall is 1-homogeneous (in the sense of Nomura) whenever for every edge xy of the distance partition{{z V() | (z, y) = i, (x, z) = j} | 0 i, j d}is equitable and its parameters do not depend on the edge xy. Let be 1-homogeneous. Then is distance-regular and also locally strongly regular with parameters (v,k,,), where v = k, k = a ₁, (v – k – 1) = k(k – 1 – ) and c ₂ + 1, since a -graph is a regular graph with valency . If c ₂ = + 1 and c ₂ 1, then is a Terwilliger graph, i.e., all the -graphs of are complete. In [11] we classified the Terwilliger 1-homogeneous graphs with c ₂ 2 and obtained that there are only three such examples. In this article we consider the case c ₂ = + 2 3, i.e., the case when the -graphs of are the Cocktail Party graphs, and obtain that either = 0, = 2 or is one of the following graphs: (i) a Johnson graph J(2m, m) with m 2, (ii) a folded Johnson graph J¯(4m, 2m) with m 3, (iii) a halved m-cube with m 4, (iv) a folded halved (2m)-cube with m 5, (v) a Cocktail Party graph K _{m × 2} with m 3, (vi) the Schläfli graph, (vii) the Gosset graph.     

Tight Distance-Regular Graphs

We consider a distance-regular graph with diameter d 3 and eigenvalues k = ₀ > ₁ > ... > _d . We show the intersection numbers a ₁, b ₁ satisfy

The Regular Near Polygons of Order (s, 2)

In this note we classify the regular near polygons of order (s, 2).     

The Distance-regular Graphs with Intersection Number and with an Eigenvalue

and with an eigenvalue . Received: October 2, 1995/Revised: Revised November 26, 1997     

On the connectedness of the complement of a ball in distance-regular graphs

An important property of strongly regular graphs is that the second subconstituent of any primitive strongly regular graph is always connected. Brouwer asked to what extent this statement can be generalized to distance-regular graphs. In this paper, we show that if γ is any vertex of a distance-regular graph Γ and t is the index where the standard sequence corresponding to the second largest eigenvalue of Γ changes sign, then the subgraph induced by the vertices at distance at least t from γ, is connected.     

Enantioselective gas chromatographic analysis of aqueous samples by on-line derivatisation. Application to enzymatic reactions

A new gas chromatography (GC) method is presented for analysing both the conversion and the enantiomeric excess (e.e.) of samples from alcohol dehydrogenase reactions. The chiral compounds studied were a series of saturated, straight chain alcohols, ranging from 2-butanol to 2-heptanol. The alcohols were converted to the corresponding trifluoroacetylated derivatives by injecting trifluoroacetic anhydride onto the column shortly after injection of the aqueous samples in split-injection mode (1:100) onto a Chiraldex G-TA capillary GC column. Injecting seven hundred aqueous enzymatic reaction mixtures according to the above-mentioned procedure revealed no noticeable loss of column performance. Using the new GC method, conventional sample work-up procedures such as extraction and off-line derivatisation are eliminated and throughput of samples is significantly enhanced.     

The Distance-Regular Graphs of Valency Four

Let W be a Coxeter group acting as a matrix group by way of the dual of the geometric representation. Let L be the lattice of intersections of all reflecting hyperplanes associated with the reflections in this representation. We show that L is isomorphic to the lattice consisting of all parabolic subgroups of W. We use this correspondence to find all W for which L is supersolvable. In particular, we show that the only infinite Coxeter group for which L is supersolvable is the infinite dihedral group. Also, we show how this isomorphism gives an embedding of L into the partition lattice whenever W is of type An, Bn or Dn. In addition, we give several results concerning non-broken circuit bases (NBC bases) when W is finite. We show that L is supersolvable if and only if all NBC bases are obtainable by a certain specific combinatorial procedure, and we use the lattice of parabolic subgroups to identify a natural subcollection of the collection of all NBC bases.