Abstract
Let p be a prime and let L be either the intransitive permutation group Cp×Cp of degree 2p or the transitive permutation group CpwrC2 of degree 2p. Let Γ be a connected G-vertex-transitive and G-edge-transitive graph and let v be a vertex of Γ. We show that if the permutation group induced by the vertex-stabiliser Gv on the neighbourhood Γ(v) is isomorphic to L then either |V(Γ)|≥p|Gv|logp(|Gv|/2), or |V(Γ)| is bounded by a constant depending only on p, or Γ is a very-well understood graph. This generalises a few recent results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
