Core-Free, Rank Two Coset Geometries from Edge-Transitive Bipartite Graphs

Details Core-Free, Rank Two Coset Geometries from Edge-Transitive Bipartite Graphs Core-Free, Rank Two Coset Geometries from Edge-Transitive Bipartite Graphs

2011-06-28

arxiv.org/abs/1106.5704v2

Mathematics

Algebraic Geometry

Scientific paper

It is known that the Levi graph of any rank two coset geometry is an edge-transitive graph, and thus coset geometries can be used to construct many edge transitive graphs. In this paper, we consider the reverse direction. Starting from edge- transitive graphs, we construct all associated core-free, rank two coset geometries. In particular, we focus on 3-valent and 4-valent graphs, and are able to construct coset geometries arising from these graphs. We summarize many properties of these coset geometries in a sequence of tables; in the 4-valent case we restrict to graphs that have relatively small vertex-stabilizers.

Affiliated with

Also associated with

No associations

Rating

Core-Free, Rank Two Coset Geometries from Edge-Transitive Bipartite Graphs 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 Core-Free, Rank Two Coset Geometries from Edge-Transitive Bipartite Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Core-Free, Rank Two Coset Geometries from Edge-Transitive Bipartite Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-41735