Intersection Array - Intersection Numbers

Intersection Numbers

It is usual to use the following notation for a distance-regular graph G. The number of vertices is n. The number of neighbors of w (that is, vertices adjacent to w) whose distance from v is i, i + 1, and i − 1 is denoted by a_i, b_i, and c_i, respectively; these are the intersection numbers of G. Obviously, a₀ = 0, c₀ = 0, and b₀ equals k, the degree of any vertex. If G has finite diameter, then d denotes the diameter and we have b_d = 0. Also we have that a_i+b_i+c_i= k

The numbers a_i, b_i, and c_i are often displayed in a three-line array

called the intersection array of G. They may also be formed into a tridiagonal matrix

$B:= \begin{pmatrix} a_0 & b_0 & 0 & \cdots & 0 & 0 \\ c_1 & a_1 & b_1 & \cdots & 0 & 0 \\ 0 & c_2 & a_2 & \cdots & 0 & 0 \\ \vdots & \vdots & \vdots & & \vdots & \vdots \\ 0 & 0 & 0 & \cdots & a_{d-1} & b_{d-1} \\ 0 & 0 & 0 & \cdots & c_d & a_d \end{pmatrix} ,$

called the intersection matrix.

Read more about this topic: Intersection Array

Famous quotes containing the words intersection and/or numbers:

“You can always tell a Midwestern couple in Europe because they will be standing in the middle of a busy intersection looking at a wind-blown map and arguing over which way is west. European cities, with their wandering streets and undisciplined alleys, drive Midwesterners practically insane.”
—Bill Bryson (b. 1951)

“The forward Youth that would appear
Must now forsake his Muses dear,
Nor in the Shadows sing
His Numbers languishing.”
—Andrew Marvell (1621–1678)