ویراساینس.
سند علمی

Arc { Transitive Non { Cayley Graphs from Regular

P. GVOZDJAK, J.

چکیده

We prove that the underlying graphs of p-gonal r-valent orientably regular maps are arc-transitive but non-Cayley if r 3 and p is a prime greater than r(r ? 1).

اسناد مشابه

  • Arc–transitive Non–cayley Graphs from Regular Maps

    سند علمی۱۹۹۴P. GVOZDJAK

    We prove that the underlying graphs of p-gonal r-valent orientably regular maps are arc-transitive but non-Cayley if r ≥ 3 and p is a prime greater than r(r − 1).

  • 5-Arc transitive cubic Cayley graphs on finite simple groups

    سند علمی۲۰۰۷Eur. J. Comb.Shang Jin Xu, Xin Gui Fang, Jie Wang, Ming Yao Xu

    In this paper, we determine all connected 5-arc transitive cubic Cayley graphs on the alternating group A47; there are only two such graphs (up to isomorphism). By earlier work of the authors, these are the only two nonnormal connected cubic arc-transitive Cayley graphs for finit

  • A construction of vertex-transitive non-Cayley graphs

    سند علمی۱۹۹۴Australasian J. CombinatoricsRobert Jajcay, Jozef Sirán

    We present a new construction of infinite families of (finite as well as infinite) vertex-transitive graphs that are not Cayley graphs; many of these turn out even to be arc-transitive. The construction based on representing vertex-transitive graphs as coset graphs of groups, and

  • Cubic Vertex-Transitive Non-Cayley Graphs of Order 8p

    سند علمی۲۰۱۲Electr. J. Comb.Jin-Xin Zhou, Yan-Quan Feng

    A graph is vertex-transitive if its automorphism group acts transitively on its vertices. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper, the cubic vertextransitive non-Cayley graphs of ord

  • Vertex-Transitive Non-Cayley Graphs with Arbitrarily Large Vertex-Stabilizer

    سند علمی۱۹۹۸MARSTON D.E. CONDER, Robert Jajcay, Cheryl Praeger

    A construction is given for an infinite family {0n} of finite vertex-transitive non-Cayley graphs of fixed valency with the property that the order of the vertex-stabilizer in the smallest vertex-transitive group of automorphisms of 0n is a strictly increasing function of n. For

  • Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter

    سند علمی۲۰۱۰Journal of Graph TheoryHeather Macbeth, Jana Siagiová, Jozef Sirán, Tomás Vetrík

    For any d ≥ 5 and k ≥ 3 we construct a family of Cayley graphs of degree d, diameter k, and order at least k((d−3)/3)k. By comparison with other available results in this area we show that, for all sufficiently large d and k, our family gives the current largest known Cayley grap