Endomorphism and automorphism graphs of finite groups
Midhuna V Ajith, Peter J Cameron, Mainak Ghosh, Aparna Lakshmanan S

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 be a group. The directed endomorphism graph, of is a directed graph with vertex set and there is a directed edge from the vertex to the vertex if and there exists an endomorphism on mapping to . The endomorphism graph, is the corresponding undirected simple graph. The automorphism graph of is similarly defined for automorphisms: it is a disjoint union of complete graphs on the orbits of . 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Geometric and Algebraic Topology · semigroups and automata theory
