Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.00712 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917238806675456 |
|---|---|
| author | Cameron, Peter J. |
| author_facet | Cameron, Peter J. |
| contents | There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.)
The purpose of this paper is to investigate extending the definitions of such graphs to general algebras (in the sense of universal algebra). It seems unlikely that such a definition can be made for the commuting graph, or for various others such as the nilpotency and Engel graphs. However, for graphs whose definition depends on the notion of subgroup or subalgebra generated by a subset, the existing definitions work without change. These graphs include several well-studied examples: the power graph, enhanced power graph, generating graph, independence graph, and rank graph. In these cases, some results about groups extend to arbitrary algebras unchanged, but others require specific properties of groups, and pose a challenge to researchers.
In the next two sections, I will describe some extensions to directed graphs (the directed power graph and the endomorphism digraph) and to simplicial complexes (the independence and strong independence complexes). The final section gives explicit descriptions of all of these objects for independence algebras. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_00712 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Graphs defined on algebras Cameron, Peter J. Combinatorics 05C25, 08A99 There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The purpose of this paper is to investigate extending the definitions of such graphs to general algebras (in the sense of universal algebra). It seems unlikely that such a definition can be made for the commuting graph, or for various others such as the nilpotency and Engel graphs. However, for graphs whose definition depends on the notion of subgroup or subalgebra generated by a subset, the existing definitions work without change. These graphs include several well-studied examples: the power graph, enhanced power graph, generating graph, independence graph, and rank graph. In these cases, some results about groups extend to arbitrary algebras unchanged, but others require specific properties of groups, and pose a challenge to researchers. In the next two sections, I will describe some extensions to directed graphs (the directed power graph and the endomorphism digraph) and to simplicial complexes (the independence and strong independence complexes). The final section gives explicit descriptions of all of these objects for independence algebras. |
| title | Graphs defined on algebras |
| topic | Combinatorics 05C25, 08A99 |
| url | https://arxiv.org/abs/2602.00712 |