Endomorphism and automorphism graphs of finite groups

TL;DR

This paper studies the properties of endomorphism and automorphism graphs of finite groups, exploring their structure, connectivity, and special cases through graph theory concepts and examples.

Contribution

It introduces the endomorphism and automorphism graphs of groups, analyzing their properties and providing classifications for various group types.

Findings

Graphs are complete for certain groups

Graphs can be disconnected or bipartite depending on the group

Examples show the complexity of these graphs in general

Abstract

Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping $a$ to $b$. The endomorphism graph, $\uend(G)$ is the corresponding undirected simple graph. The automorphism graph of $G$ is similarly defined for automorphisms: it is a disjoint union of complete graphs on the orbits of $\Aut(G)$. The endomorphism digraph is a special case of a digraph associated with a transformation monoid, and we begin by introducing this. We have explored graph theoretic properties like size, planarity, girth etc. and tried finding out for which types of groups these graphs are complete, diconnected, trees, bipartite and so on, as well as computing these graphs for some special groups. We conclude with examples showing that things are not always simple.