Automorphism groups of bicoset digraphs (Q6877642)

This paper is the third in a series [the first and the second author, ``Finding automorphism groups of double coset graphs and Cayley graphs are equivalent'', Preprint, \url{arXiv:2407.02316}; the second author, Art Discrete Appl. Math. 5, No. 3, Paper No. P3.06, 22 p. (2022; Zbl 1497.05112)] investigating symmetry relationships between group-based graph constructions. It extends previous recognition theorems for Cayley and coset digraphs [Barber and Dobson, loc. cit.] and Haar graphs of abelian groups [Dobson, loc. cit.] to the more general class of bicoset digraphs. The work builds upon the theory of \(X\)-joins [\textit{R. L. Hemminger}, J. Comb. Theory 5, 408--418 (1968; Zbl 0184.49002)] and the classification of bipartite constructions like Haar graphs [\textit{M. Hladnik} et al., Discrete Math. 244, No. 1--3, 137--152 (2002; Zbl 0993.05084)] and semisymmetric graphs [\textit{S. Du} and \textit{M. Xu}, Commun. Algebra 28, No. 6, 2685--2715 (2000; Zbl 0944.05051)].\N\NThe central result is a recognition theorem (Theorem 5.4) that identifies when a bicoset digraph \(B(G, H_0, H_1; S_0, S_1)\) is an \(X\)-join of a collection of empty graphs. The authors prove that the automorphism groups of these digraphs can be fully recovered from their natural irreducible quotients (Theorem 4.8), specifically showing that every automorphism is ``natural'' if the quotient is irreducible.\N\NThe main results are obtained through a structural reduction process:\N\begin{itemize}\N\item neighborhood partitioning: defining the unworthy partition (\(R_{\Gamma}\)) based on vertices sharing identical in- and out-neighborhoods;\N\item quotient reduction: collapsing the unworthy partition cells to obtain an irreducible quotient digraph, which simplifies the symmetry analysis;\N\item algebraic characterization: using the property that the connection sets \(S_i\) are unions of double cosets (\(S_i = K_i S_i K_{i+1}\)) to algebraically verify the \(X\)-join structure directly from the group-theoretic data.\N\end{itemize}\NSection 1 is an introduction and Section 2 presents formal definitions of Haar and bicoset digraph constructions. In Section 3, a generalization of \(X\)-join theory and the definition of natural automorphisms for digraphs is given. Section 4 deals with automorphism groups for reducible bicoset digraphs using join partitions. In Section 5, the main recognition theorem and its application to wreath products and Haar digraphsis presented.