On 1-Arc-regular Graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On 1-Arc-regular Graphs

A graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arcs. In this paper, we investigate 1-arc-regular graphs of prime valency, especially of valency 3. First, we prove that if G is a soluble group then a (G, 1)-arc-regular graph must be a Cayley graph of a subgroup of G . Next we consider trivalent Cayley graphs of a finite nonabelian simple group and obtain...

متن کامل

Finite vertex primitive 2-arc regular graphs

A classification is given of finite graphs that are vertex primitive and 2arc regular. The classification involves various new constructions of interesting 2-arc transitive graphs.

متن کامل

Arc { Transitive Non { Cayley Graphs from Regular

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).

متن کامل

On regular (1, q)-extendable graphs

Let G be a graph with a maximum matching of size q, and let p ≤ q be a positive integer. Then G is called (p, q)-extendable if every set of p independent edges can be extended to a matching of size q. If G is a graph of even order n and 2q = n, then (p, q)-extendable graphs are exactly the p-extendable graphs defined by Plummer [Discrete Math. 31 (1980), 201–210]. Let d ≥ 3 be an integer, and l...

متن کامل

EMBEDDING /c-REGULAR GRAPHS IN /c +1-REGULAR GRAPHS

Given a A:-regular graph G of order n, what is the minimum number v(G) of extra vertices required to embed G in a /<+1-regular graph? Clearly v(G) = 0 precisely when the complement G of G has a 1-factor—in particular, when n ^ 2k is even. Suppose G has no 1-factor: if n, k have opposite parity we show that v(G) = 1, while if n, k have the same parity (which must then be even with n < 2k) we sho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2002

ISSN: 0195-6698

DOI: 10.1006/eujc.2002.0579