Classification of a class of distance-regular graphs via completely regular codes (Q1262870): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0166-218x(90)90106-m / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1989162332 / rank | |||
Normal rank |
Latest revision as of 09:58, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Classification of a class of distance-regular graphs via completely regular codes |
scientific article |
Statements
Classification of a class of distance-regular graphs via completely regular codes (English)
0 references
1990
0 references
P-polynomial association chemes
0 references
distance-regular graphs
0 references