scientific article; zbMATH DE number 563236
From MaRDI portal
Publication:4291017
zbMATH Open0793.05146MaRDI QIDQ4291017FDOQ4291017
Authors: Chris Godsil 
Publication date: 5 May 1994
Title of this publication is not available (Why is that?)
Recommendations
- Distance regular covers of the complete graph
- Covering radius and dual distance
- Regular polytopic distances
- Coverings and distance-regular graphs
- Distance regular covers of complete graphs from Latin squares
- Distance-regular circulants
- scientific article; zbMATH DE number 782048
- Covering radius, codimension, and dual-distance width
- scientific article; zbMATH DE number 91039
- scientific article; zbMATH DE number 3867351
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30)
Cited In (15)
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
- Diameter bounds for geometric distance-regular graphs
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- Geometric aspects of 2-walk-regular graphs
- Delsarte clique graphs
- On geometric distance-regular graphs with diameter three
- Distance-regular graphs with intersection arrays \(\{52, 35, 16; 1, 4, 28\}\) and \(\{69, 48, 24; 1, 4, 46\}\) do not exist
- Asymptotic Delsarte cliques in distance-regular graphs
- Geometric distance-regular graphs without 4-claws
- On completely regular codes with minimum eigenvalue in geometric graphs
- A new characterization of the dual polar graphs
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- Geometric antipodal distance-regular graphs with a given smallest eigenvalue
- There does not exist a distance-regular graph with intersection array \(\{80, 54,12; 1, 6, 60\}\)
- Distance-regular graphs without 4-claws
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291017)
