511 KB66 KB211 KB3 KB2022Dobson, Edward Tauscherletnik:5številka:iss. 3str. 1-22DOI:10.26493/2590-9770.1391.f46COBISSID_HOST:133555971ISSN:2590-9770URN:URN:NBN:SI:doc-SD5IE315enFakulteta za matematiko, naravoslovje in informacijske tehnologijeThe art of discrete and applied mathematicsautomorphism groupHaar graphs-arcOn automorphisms of Haar graphsof abelian groups|Let G be a group and ?$SG$?. In this paper, a Haar graph of G with connection set S has vertex set ?$2G$? and edge set ?${(0,g)(1,gs)$?:?$gG$? and ?$sS}$?. Haar graphs are then natural bipartite analogues of Cayley digraphs, and are also called BiCayley graphs. We first examine the relationship between the automorphism group of the Cayley digraph of G with connection set S and the Haar graph of G with connection set S. We establish that the automorphism group of a Haar graph contains a natural subgroup isomorphic to the automorphism group of the corresponding Cayley digraph. In the case where G is abelian, we show there are exactly four situations in which the automorphism group of the Haar graph can be larger than the natural subgroup corresponding to the automorphism group of the Cayley digraph together with a specific involution, and analyze the full automorphism group in each of these cases. As an application, we show that all s-transitive Cayley graphs of generalized dihedral groups have a quasiprimitive automorphism group, can be constructed from digraphs of smaller order, or are Haar graphs of abelian groups whose automorphism groups have a particular permutation group theoretic propertyTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije