Note on infinite families of trivalent semisymmetric graphs (Q1864584): Difference between revisions

A graph is called semisymmetric if it is edge-transitive and regular, but not vertex-transitive. The smallest valency of a semisymmetric graph is three, and all semisymmetric graphs are bipartite. Given a group \(G\) with subgroups \(R\) and \(L\), and a subset \(D\) of \(G\) which is a union of some double cosets \(RgL\), the authors define the bicoset graph \((G,R,L;D)\) as the graph whose vertices are the right cosets of \(R\) and of \(L\) in \(G\), with, for each \(g \in G\) and \(d \in D\), an edge connecting \(Lg\) and \(Rdg\). They construct two infinite families of trivalent semisymmetric graphs, as certain bicoset graphs with \(G=\text{ PSL}(2,p)\) and \(G=\text{ PGL}(2,p)\) (\(p\) a prime).