On geometric distance-regular graphs with diameter three (Q2441641): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Geometric distance-regular graphs without 4-claws / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are only finitely many distance-regular graphs of fixed valency greater than two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delsarte clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic Distance-Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-regular graph with the intersection array {45, 30, 7; 1, 2, 27} does not exist / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Higman-Haemers inequality for thick regular near polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-regular graphs of valency 6 and \(a_1=1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distance-regular graphs with smallest eigenvalue at least \(- m\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-biregular graphs with 2-valent vertices and distance regular line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\) / rank
 
Normal rank

Latest revision as of 12:02, 7 July 2024

scientific article
Language Label Description Also known as
English
On geometric distance-regular graphs with diameter three
scientific article

    Statements

    Identifiers