Determination of the distance-regular graphs without 3-claws

DOI10.1016/S0012-365X(96)00022-2MaRDI QIDQ1356547zbMATH OpenOpenAlexFDO

Authors Aart Blokhuis, Andries E. Brouwer

Publication date 9 June 1997

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(96)00022-2

zbMATH Keywords

distance-regular graphslattice graphSchläfli graphstrongly regular graphtriangular graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3

Cited in

(9)

• A characterization of some graphs which do not contain 3-claws
• Geometric distance-regular graphs without 4-claws
• On bounding the diameter of a distance-regular graph
• Distance-regular graphs without 4-claws
• On distance-regular graphs without 4-claws
• On the geometricity of distance-regular graphs without 4-claws
• Distance-regular graphs with or at least half the valency
• The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\)
• A characterization of one class of graphs without 3-claws

This page was built for publication: Determination of the distance-regular graphs without 3-claws

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