On \(k\)-connected-homogeneous graphs
From MaRDI portal
Publication:2306006
DOI10.1016/j.jcta.2020.105234zbMath1435.05121arXiv1805.03115OpenAlexW2800637474MaRDI QIDQ2306006
Cheryl E. Praeger, Jin-Xin Zhou, Alice Devillers, Joanna B. Fawcett
Publication date: 20 March 2020
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.03115
Related Items (2)
Finite 3-connected-set-homogeneous locally \(2\mathbf{K}_n\) graphs and \(s\)-arc-transitive graphs ⋮ Finite 3-set-homogeneous graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rank three permutation groups with rank three subconstituents
- Countable connected-homogeneous graphs
- \(k\)-CS-transitive infinite graphs
- 6-transitive graphs
- Combinatorially homogeneous graphs
- The nonexistence of 8-transitive graphs
- Strongly regular graphs
- Homogeneous graphs
- Locally polar spaces and related rank 3 groups
- Homogeneity conditions in graphs
- The infinitude of 7-arc-transitive graphs
- Finite distance-transitive generalized polygons
- The Magma algebra system. I: The user language
- On k-homogeneous posets and graphs
- Locally triangular graphs and rectagraphs with symmetry
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- A simple group of order 44,352,000
- The nonexistence of rank three permutation groups of degree 3250 and subdegree 57
- Presentations for (G, s)-transitive graphs of small valency
- On Moore Graphs with Diameters 2 and 3
- An O'Nan-Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs
- The Rank 3 Permutation Representations of the Finite Classical Groups
- The Finite Primitive Permutation Groups of Rank Three
- Countable Ultrahomogeneous Undirected Graphs
- Smoothly Embeddable Subgraphs
- MOORE GEOMETRIES AND RANK 3 GROUPS HAVING μ=1
This page was built for publication: On \(k\)-connected-homogeneous graphs