A remark on bipartite distance-regular graphs of even valency (Q1895820): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01929483 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1994305621 / rank | |||
Normal rank |
Latest revision as of 11:49, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A remark on bipartite distance-regular graphs of even valency |
scientific article |
Statements
A remark on bipartite distance-regular graphs of even valency (English)
0 references
28 January 1996
0 references
Let \(\Gamma\) be a distance-regular graph with the intersection numbers \(p^s_{i,j}\), that is the number of vertices \(x\) with \(\delta(u, x)= i\) and \(\delta(v, x)= j\) for \(u, v\in \Gamma\) at distance \(s= \delta(u, v)\). The author establishes the following theorem: Given a bipartite distance-regular graph \(\Gamma\) with even valency \(b_0\) and \(t> 1\) the length of any series of \((1, 0, 1)\)'s in the intersection array modulo 2, then \(t+ 1\mid r_1+ 1\), with \(r_1\) the length of the first series and \(b_0= p^0_{1,1}\).
0 references
distance-regular graph
0 references
intersection numbers
0 references
distance
0 references
valency
0 references
series
0 references
intersection array
0 references