The finite vertex-primitive and vertex-biprimitive -transitive graphs for ≥4

By Caiheng Li. 2001

62 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/1b8a031e329c91f0ce4b3299f5f509696e25b4a4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Dragan Marusic
2. Z. Lu
3. Caiheng Li

In Discrete Mathematics and Combinatorics

1. Dragan Marusic
2. Z. Lu
3. Caiheng Li
4. István Kovács

In Electrical and Electronic Engineering

1. Dragan Marusic
2. Z. Lu
3. Caiheng Li
4. István Kovács

Citations in the corpus

• On primitive permutation groups with small suborbits and their orbital graphs (2004, methodology): “In fact, vertex-primitive 4-arc-transitive graphs have been classified in [7].”