Using bi-coset graphs to construct small regular and biregular graphs
From MaRDI portal
Publication:6204355
DOI10.1016/j.disc.2024.113946MaRDI QIDQ6204355
Jajcay, Robert, Pavol Jánoš, Štefan Gyürki, Yan Wang, Jozef Širáň
Publication date: 27 March 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
- New graphs related to \((p,6)\) and \((p,8)\)-cages
- On the limitations of the use of solvable groups in Cayley graph cage constructions
- G-graphs: An efficient tool for constructing symmetric and semisymmetric graphs
- Constructions for cubic graphs with large girth
- Dynamic cage survey
- On biregular bipartite graphs of small excess
- On the girth of voltage graph lifts
- \(G\)-graphs: a new representation of groups
- On constructing expander families of G-graphs
- Coset Intersection Graphs for Groups
- On a relation between bipartite biregular cages, block designs and generalized polygons
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Using bi-coset graphs to construct small regular and biregular graphs