Skip to main content
Log in

On Non-Cayley Tetravalent Metacirculant Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 In connection with the classification problem for non-Cayley tetravalent metacirculant graphs, three families of special tetravalent metacirculant graphs, denoted by Φ1, Φ2 and Φ3, have been defined [11]. It has also been shown [11] that any non-Cayley tetravalent metacirculant graph is isomorphic to a union of disjoint copies of a non-Cayley graph in one of the families Φ1, Φ2 or Φ3. A natural question raised from the result is whether all graphs in these families are non-Cayley. We have proved recently in [12] that every graph in Φ2 is non-Cayley. In this paper, we show that every graph in Φ1 is also a connected non-Cayley graph and find an infinite class of connected non-Cayley graphs in the family Φ3.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: October, 2001 Final version received: July 29, 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tan, N. On Non-Cayley Tetravalent Metacirculant Graphs. Graphs Comb 18, 795–802 (2002). https://doi.org/10.1007/s003730200066

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730200066

Keywords

Navigation