A census of infinite distance-transitive graphs
From MaRDI portal
Publication:1584448
DOI10.1016/S0012-365X(98)00063-6zbMath0957.05114OpenAlexW1996293936MaRDI QIDQ1584448
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00063-6
Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12)
Related Items (7)
Simplicity of some automorphism groups. ⋮ Neostability in countable homogeneous metric spaces ⋮ Countable connected-homogeneous graphs ⋮ A survey of homogeneous structures ⋮ \(k\)-CS-transitive infinite graphs ⋮ Metrically homogeneous graphs of diameter 3 ⋮ Homogeneous Cayley objects
Cites Work
- A new strongly minimal set
- Amalgams and embeddings of projective planes
- Some universal graphs
- 6-transitive graphs
- The nonexistence of 8-transitive graphs
- Infinite distance transitive graphs of finite valency
- Covers of graphs and EGQs
- Two-graphs and doubly transitive groups
- Transitivity of permutation groups on unordered sets
- Homogeneous graphs
- Two-graphs and trees
- Set-homogeneous graphs
- There are only finitely many finite distance-transitive graphs of given valency greater than two
- On k-homogeneous posets and graphs
- A Universal Structure for N -Free Graphs
- On Distance-Transitive Graphs
- The Affine Permutation Groups of Rank Three
- Countable Ultrahomogeneous Undirected Graphs
- Reducts of the random graph
- Countable Homogeneous Tournaments
- PRIMITIVE AND IMPRIMITIVE GRAPHS
- A Characterization of Comparability Graphs and of Interval Graphs
- A family of countable homogeneous graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A census of infinite distance-transitive graphs
