Lesson plan
Commuting graph
In mathematics, the commuting graph of a semigroup, or in particular of a group, is an undirected graph in which the vertices are elements of the semigroup and there is an edge between any pair of elements that commute (that is, there is an edge between vertices and if and only if in the semigroup). Commuting graphs have been used to study groups and semigroups by seeking relationships between the combinatorial structure of the graph and the algebraic structure of the group or semigroup. Depending on the author, the vertex set may comprise every element of the semigroup, or only the non-central elements (since the central elements — those elements of a semigroup that commute with every other element — would always form a complete subgraph, every vertex of which would be adjacent to every vertex of the whole commuting graph). If the central elements are excluded, the commuting graph is usually only defined for non-abelian groups and non-commutative semigroups (since in these cases the commuting graph would be empty). For the purposes of this article, the vertices of the commuting graph are the non-central elements unless otherwise noted.
Article summary
In mathematics, the commuting graph of a semigroup, or in particular of a group, is an undirected graph in which the vertices are elements of the semigroup and there is an edge between any pair of elements that commute (that is, there is an edge between vertices and if and only if in the semigroup). Commuting graphs have been used to study groups and semigroups by seeking relationships between the combinatorial structure of the graph and the algebraic structure of the group or semigroup. Depending on the author, the vertex set may comprise every element of the semigroup, or only the non-central elements (since the central elements — those elements of a semigroup that commute with every other element — would always form a complete subgraph, every vertex of which would be adjacent to every vertex of the whole commuting graph). If the central elements are excluded, the commuting graph is usually only defined for non-abelian groups and non-commutative semigroups (since in these cases the commuting graph would be empty). For the purposes of this article, the vertices of the commuting graph are the non-central elements unless otherwise noted.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.