On the Weiss conjecture for finite locally primitive graphs
From MaRDI portal
Publication:4487708
DOI10.1017/S0013091500020745zbMath0949.05037WikidataQ56988014 ScholiaQ56988014MaRDI QIDQ4487708
Marston D. E. Conder, Cai Heng Li, Cheryl E. Praeger
Publication date: 22 June 2000
Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)
Related Items
On finite G-locally primitive graphs and the Weiss conjecture, Vertex-quasiprimitive locally primitive graphs, A theory of semiprimitive groups, The vertex-transitive and edge-transitive tetravalent graphs of square-free order, Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph, On graph-restrictive permutation groups, On locally primitive graphs of order \(18p\), The edge-transitive tetravalent Cayley graphs of square-free order, On locally primitive Cayley graphs of finite simple groups, Tetravalent edge-transitive Cayley graphs of \({\mathrm{PGL}(2,p)}\), Locally primitive Cayley graphs of dihedral groups, On the automorphism groups of quasiprimitive almost simple graphs, On arc-transitive Cayley digraphs of out-valency 3, On the automorphism groups of symmetric graphs admitting an almost simple group, On edge-transitive graphs of square-free order, Symmetric graphs of prime valency associated with some almost simple groups, Prime-valent symmetric graphs admitting alternating transitive group, Arc-transitive Cayley graphs on nonabelian simple groups with prime valency, Analysing finite locally 𝑠-arc transitive graphs, Arc-transitive graphs of square-free order and small valency, ON THE ORDER OF ARC-STABILIZERS IN ARC-TRANSITIVE GRAPHS, Graphs with automorphism groups admitting composition factors of bounded rank, Vertex-Transitive Cubic Graphs of Square-Free Order
Cites Work
- On the full automorphism group of a graph
- Vertex-transitive graphs
- Bounds for orders of maximal subgroups
- Graphs and finite permutation groups
- Doubly primitive vertex stabilisers in graphs
- On the Sims Conjecture and Distance Transitive Graphs
- An O'Nan-Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs
- Permutation Groups with Projective Unitary Subconstituents
- ARC TRANSITIVITY IN GRAPHS II
- ARC TRANSITIVITY IN GRAPHS III
- Groups with a (B, N)–pair and locally transitive graphs
- An application of p-factorization methods to symmetric graphs
- Graphs with a locally linear group of automorphisms
- ARC TRANSITIVITY IN GRAPHS