Core-free, rank two coset geometries from edge-transitive bipartite graphs
From MaRDI portal
Publication:2931323
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph representations (geometric and intersection representations, etc.) (05C62) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Homomorphism, automorphism and dualities in linear incidence geometry (51A10) Other finite incidence structures (geometric aspects) (51E30)
Abstract: 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.
Recommendations
Cited in
(4)
This page was built for publication: Core-free, rank two coset geometries from edge-transitive bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931323)