A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph (Q438889): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: 1109.2195 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992965 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Intersection numbers of bipartite distance-regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2716030 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interlacing eigenvalues and graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On subgraphs in distance-regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distance-regular graphs with or at least half the valency / rank | |||
Normal rank |
Latest revision as of 12:56, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph |
scientific article |
Statements
A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph (English)
0 references
31 July 2012
0 references
distance-regular graphs
0 references
intersection numbers
0 references
Hadamard graphs
0 references
hypercubes
0 references
diameter
0 references