Note on infinite families of trivalent semisymmetric graphs
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).
- A classification of semisymmetric graphs of order 2pq
- An Edge but not Vertex Transitive Cubic Graph*
- An infinite family of biprimitive semisymmetric graphs
- Biprimitive graphs of smallest order
- Constructing cubic edge- but not vertex-transitive graphs
- scientific article; zbMATH DE number 4158649 (Why is no real title available?)
- scientific article; zbMATH DE number 4023321 (Why is no real title available?)
- scientific article; zbMATH DE number 3745208 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- scientific article; zbMATH DE number 3046496 (Why is no real title available?)
- On edge but not vertex transitive regular graphs
- On the Symmetry of Cubic Graphs
- Regular line-symmetric graphs
- Semisymmetry of generalized Folkman graphs
- Vertex-transitive graphs
- A worthy family of semisymmetric graphs
- Characterising vertex-star transitive and edge-star transitive graphs
- A census of semisymmetric cubic graphs on up to 768 vertices
- Distance-balanced graphs: symmetry conditions
- On edge-transitive cubic graphs of square-free order
- scientific article; zbMATH DE number 2214062 (Why is no real title available?)
- Pentavalent semisymmetric graphs of square‐free order
- Edge-transitive cubic graphs of twice square-free order
- On biprimitive semisymmetric graphs
- Semisymmetric cubic graphs of twice odd order
- G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
- Edge-transitive regular \(Z_n\)-covers of the Heawood graph
This page was built for publication: Note on infinite families of trivalent semisymmetric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864584)
