On automorphisms of distance-regular graph with intersection array \(\{15, 12, 1; 1, 2, 15\}\) (Q1761067): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992965 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4231664 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4000288 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On automorphisms of distance-regular graphs with intersection array \(\{56,\, 45,\, 1;\, 1,\, 9,\, 56\}\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On automorphisms of a distance-regular graph with intersection array \(\{81, 60, 1; 1, 20, 81\}\) / rank | |||
Normal rank |
Latest revision as of 20:43, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On automorphisms of distance-regular graph with intersection array \(\{15, 12, 1; 1, 2, 15\}\) |
scientific article |
Statements
On automorphisms of distance-regular graph with intersection array \(\{15, 12, 1; 1, 2, 15\}\) (English)
0 references
15 November 2012
0 references
Higman's method
0 references
0 references