A characterization of distance-regular graphs with diameter three

Research output: Book/ReportReport

314 Downloads (Pure)

Abstract

We characterize the distance-regular graphs with diameter three by giving an expression for the number of vertices at distance two from each given vertex, in terms of the spectrum of the graph.
Original languageEnglish
PublisherUnknown Publisher
VolumeFEW 695
Publication statusPublished - 1995

Publication series

NameResearch memorandum / Tilburg University, Faculty of Economics and Business Administration
VolumeFEW 695

Keywords

  • Graphs
  • mathematics

Fingerprint

Dive into the research topics of 'A characterization of distance-regular graphs with diameter three'. Together they form a unique fingerprint.

Cite this