Year-end Sale % OFF 
Abstract
A characterisation is given of edge-transitive Cayley graphs of valency 4 on odd number of vertices. The characterisation is then applied to solve several problems in the area of edge-transitive graphs: answering a question proposed by Xu [Automorphism groups and isomorphisms of Cayley graphs, Discrete Math. 182 (1998) 309–319] regarding normal Cayley graphs; providing a method for constructing edge-transitive graphs of valency 4 with arbitrarily large vertex-stabiliser; constructing and characterising a new family of half-transitive graphs. Also this study leads to a construction of the first family of arc-transitive graphs of valency 4 which are non-Cayley graphs and have a ‘nice’ isomorphic 2-factorisation.
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.
