55 research outputs found

    A Classification of Semisymmetric Cubic Graphs of Order 28p&sup2

    Full text link
    A graph is said to be semisymmetric if its full automorphism group actstransitively on its edge set but not on its vertex set. In this paper, we prove thatthere is only one semisymmetric cubic graph of order 28p<sub>2</sub>, where p is a prime.DOI : http://dx.doi.org/10.22342/jims.16.2.38.139-14

    Semisymmetric cubic graphs of twice odd order

    Full text link
    The groups which can act semisymmetrically on a cubic graph of twice odd order are determined modulo a normal subgroup which acts semiregularly on the vertices of the graph

    Edge-transitive regular Zn-covers of the Heawood graph

    Get PDF
    AbstractA regular cover of a graph is said to be an edge-transitive cover if the fibre-preserving automorphism subgroup acts edge-transitively on the covering graph. In this paper we classify edge-transitive regular Zn-covers of the Heawood graph, and obtain a new infinite family of one-regular cubic graphs. Also, as an application of the classification of edge-transitive regular Zn-covers of the Heawood graph, we prove that any bipartite edge-transitive cubic graph of order 14p is isomorphic to a normal Cayley graph of dihedral group if the prime p>13

    Cubic symmetric graphs of order a small number times a prime or a prime square

    Get PDF
    AbstractA graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, the s-regular elementary abelian coverings of the complete bipartite graph K3,3 and the s-regular cyclic or elementary abelian coverings of the complete graph K4 for each s⩾1 are classified when the fibre-preserving automorphism groups act arc-transitively. A new infinite family of cubic 1-regular graphs with girth 12 is found, in which the smallest one has order 2058. As an interesting application, a complete list of pairwise non-isomorphic s-regular cubic graphs of order 4p, 6p, 4p2 or 6p2 is given for each s⩾1 and each prime p

    Classifying cubic s-regular graphs of orders 22p and 22p²

    No full text
    A graph is s-regular if its automorphism group acts regularly on the set of s-arcs. In this study, we classify the connected cubic s-regular graphs of orders 22p and 22p² for each s ≥ 1, and each prime p
    corecore