Recognizing bicoset digraphs which are $X$-joins and automorphism groups of bicoset digraphs
Combinatorics
2024-09-18 v1
Abstract
We examine bicoset digraphs and their natural properties from the point of view of symmetry. We then consider connected bicoset digraphs that are -joins with collections of empty graphs, and show that their automorphism groups can be obtained from their natural irreducible quotients. We then show that such digraphs can be recognized from their connection sets.
Keywords
Cite
@article{arxiv.2409.11092,
title = {Recognizing bicoset digraphs which are $X$-joins and automorphism groups of bicoset digraphs},
author = {Rachel Barber and Ted Dobson and Gregory Robson},
journal= {arXiv preprint arXiv:2409.11092},
year = {2024}
}
Comments
The work of the second author is supported in part by the Slovenian Research Agency (research program P1-0285 and research projects N1-0140, N1-0160, J1-2451, N1-0208, J1-3001, J1-3003, J1-4008, and J1-50000), while the work of the third author is supported in part by the Slovenian Research Agency (research program P1-0285 and Young Researchers Grant)