Using bi-coset graphs to construct small regular and biregular graphs
From MaRDI portal
Recommendations
Cites work
- G-graphs for the cage problem: a new upper bound
- \(G\)-graphs: a new representation of groups
- Combinatorial designs with applications. Notes
- Constructions for cubic graphs with large girth
- Coset intersection graphs for groups.
- Dynamic cage survey
- G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
- scientific article; zbMATH DE number 2185572 (Why is no real title available?)
- scientific article; zbMATH DE number 3137862 (Why is no real title available?)
- scientific article; zbMATH DE number 1409234 (Why is no real title available?)
- scientific article; zbMATH DE number 3189017 (Why is no real title available?)
- scientific article; zbMATH DE number 3046496 (Why is no real title available?)
- New graphs related to \((p,6)\) and \((p,8)\)-cages
- On a relation between bipartite biregular cages, block designs and generalized polygons
- On biregular bipartite graphs of small excess
- On constructing expander families of G-graphs
- On the girth of voltage graph lifts
- On the limitations of the use of solvable groups in Cayley graph cage constructions
This page was built for publication: Using bi-coset graphs to construct small regular and biregular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204355)