Tetravalent arc-transitive graphs with unbounded vertex-stabilisers

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages

Scientific paper

It has long been known that there exist finite connected tetravalent arc-transitive graphs with arbitrarily large vertex-stabilisers. However, beside a well known family of exceptional graphs, related to the lexicographic product of a cycle with an edgeless graph on two vertices, only a few such infinite families of graphs are known. In this paper, we present two more families of tetravalent arc-transitive graphs with large vertex-stabilisers, each significant for its own reason.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Tetravalent arc-transitive graphs with unbounded vertex-stabilisers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tetravalent arc-transitive graphs with unbounded vertex-stabilisers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tetravalent arc-transitive graphs with unbounded vertex-stabilisers will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-226078

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.