Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

On tetravalent s-regular Cayley graphs

    https://doi.org/10.1142/S021949881750195XCited by:4 (Source: Crossref)

    A Cayley graph Γ=Cay(G,S) is said to be core-free if G is core-free in some X for GXAutΓ. A graph Γ is called s-regular if AutΓ acts regularly on its s-arcs. It is shown in this paper that if s2, then there exist no core-free tetravalent s-regular Cayley graphs; and for s3, every tetravalent s-regular Cayley graph is a normal cover of one of the three known core-free graphs. In particular, a characterization of tetravalent s-regular Cayley graphs is given.

    Communicated by X.-D. Hou

    AMSC: 20B25, 05C25, 05E18