Finite vertex-primitive and vertex-biprimitive 2-path-transitive graphs

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

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

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

منابع مشابه

Finite vertex-primitive and vertex-biprimitive 2-path-transitive graphs

This paper presents a classification of vertex-primitive and vertex-biprimitive 2-path-transitive graphs which are not 2-arc-transitive. The classification leads to constructions of new examples of half-arc-transitive graphs.

متن کامل

THE FINITE VERTEX-PRIMITIVE AND VERTEX-BIPRIMITIVE s-TRANSITIVE GRAPHS FOR s ≥ 4

A complete classification is given for finite vertex-primitive and vertex-biprimitive s-transitive graphs for s ≥ 4. The classification involves the construction of new 4-transitive graphs, namely a graph of valency 14 admitting the Monster simple group M, and an infinite family of graphs of valency 5 admitting projective symplectic groups PSp(4, p) with p prime and p ≡ ±1 (mod 8). As a corolla...

متن کامل

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.

متن کامل

Finite Transitive Permutation Groups and Finite Vertex-Transitive Graphs

The theory of vertex-transitive graphs has developed in parallel with the theory of transitive permutation groups. In this chapter we explore some of the ways the two theories have influenced each other. On the one hand each finite transitive permutation group corresponds to several vertex-transitive graphs, namely the generalised orbital graphs which we shall discuss below. On the other hand, ...

متن کامل

Vertex-transitive CIS graphs

A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and vertex-transitive if, for every pair of vertices, there exists an automorphism of the graph mapping one to the other. We show that a vertex-transitive graph is CIS if and o...

متن کامل

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


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

ژورنال

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

سال: 2011

ISSN: 0925-9899,1572-9192

DOI: 10.1007/s10801-011-0333-1