On finite 2-distance-primitive graphs (Q6542011)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On finite 2-distance-primitive graphs |
scientific article; zbMATH DE number 7851536
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finite 2-distance-primitive graphs |
scientific article; zbMATH DE number 7851536 |
Statements
On finite 2-distance-primitive graphs (English)
0 references
21 May 2024
0 references
A vertex-transitive graph is called 2-distance-primitive if the vertex stabilizer is primitive on both the first-step and the second-step neighborhoods. The paper under review shows that there are infinitely many 2-distance-primitive graphs with unbounded large valency and diameter, gives a classification of the 2-distance-primitive graphs with valency at most 9, and determines all the 2-distance-primitive graphs with the order of a product of two primes.
0 references
transitive graph
0 references
2-distance-primitive graph
0 references
primitive group
0 references
0 references
0 references
