There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency (Q3645154): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two theorems concerning the Bannai-Ito conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distance-regular graphs with fixed valency / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distance-regular graphs with fixed valency. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distance-regular graphs with fixed valency. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonexistence of certain generalized polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7 / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/crelle.2009.080 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014708145 / rank
 
Normal rank

Latest revision as of 10:12, 30 July 2024

scientific article
Language Label Description Also known as
English
There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency
scientific article

    Statements

    Identifiers