A characterization of distance-regular graphs with diameter three (Q1361464): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3992965 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regular graphs with four eigenvalues / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds on special subsets in graphs, eigenvalues and association schemes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interlacing eigenvalues and graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distance-regularity and the spectrum of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Polynomial of a Graph / rank | |||
Normal rank |
Latest revision as of 16:42, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A characterization of distance-regular graphs with diameter three |
scientific article |
Statements
A characterization of distance-regular graphs with diameter three (English)
0 references
9 November 1997
0 references
eigenvalues of graphs
0 references
strongly regular graphs
0 references
distance-regular graphs
0 references
diameter
0 references
distance
0 references
spectrum
0 references