On distance-regular graphs with height two

DOI10.1023/A:1022440414422MaRDI QIDQ1906253zbMATH OpenFDO

Authors Masato Tomiyama

Publication date 13 August 1996

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1022440414422

zbMATH Keywords

cliquediameterdistancedistance-regular graphheightstrongly regular graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Review text

Let \(\Gamma\) be a graph, \(d\) the diameter of \(\Gamma\), and for every vertex \(\alpha\) in \(\Gamma\), let \(\Gamma_i(\alpha)= \{\beta\mid \partial(\alpha, \beta)= i\}\) for \(i= 0,\dots, d\). A connected graph \(\Gamma\) is called distance-regular if \(|\Gamma_i(\alpha)\cap \Gamma_j(\beta)|\) depends only on the distance between \(\alpha\) and \(\beta\). In this case we write \(p^l_{ij}= |\Gamma_i(\alpha)\cap \Gamma_j(\beta)|\), where \(\partial(\alpha, \beta)= l\). Let \(h= \max\{i\mid p^d_{di}\neq 0\}\) be the height of \(\Gamma\). Theorem. Let \(\Gamma\) be a distance-regular graph with diameter \(d\) at least 3, and height \(h= 2\). Suppose that, for every \(\alpha\in \Gamma\) and \(\beta\in \Gamma_d(\alpha)\), the intersection \(\Gamma_d(\alpha)\cap \Gamma_2(\beta)\) is a clique. Then \(d= 3\) and \(\Gamma\) is isomorphic to \(J(8,3)\). Corollary. Let \(\Gamma\) be a distance-regular graph with diameter \(d\) at least 3, and \(\Delta\) a strongly regular graph such that \(\Delta_2(\beta)\) is a disjoint union of cliques for every \(\beta\in \Delta\). If \(\Gamma_d(\alpha)\) is isomorphic to \(\Delta\) for every \(\alpha\in \Gamma\), then \(d= 3\) and \(\Gamma\) is isomorphic to \(J(8, 3)\).

Recommendations

• On distance-regular graphs with height two. II
• scientific article; zbMATH DE number 43547
• Distance-regular graphs of the height h
• On local structure of a distance-regular graph of Hamming type
• On a distance-regular graph of even height with k_e=k_f

Cites work

• A remark on the intersection arrays of distance-regular graphs
• Bounding the diameter of a distance regular graph by a function of \(k_ d\)
• Bounding the diameter of a distance regular graph by a function of \(k_ d\). II
• Characerization of a class of distance regular graphs.
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• Second neighbourhoods of strongly regular graphs
• The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)

Cited in

(5)

• On local structure of a distance-regular graph of Hamming type
• On distance-regular graphs with height two. II
• Distance-regular graphs of large diameter that are completely regular clique graphs
• Two distance-regular graphs
• Distance-regular graphs of the height h

This page was built for publication: On distance-regular graphs with height two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906253)