Universal commutator graphs
From MaRDI portal
Publication:2276972
Let G be a group, S a subset of G and C(G,S) the (commutator) graph with vertex set S and x adjacent to y if \(xy=yx\). The author proves: There is a sequence of groups G(n) of order \(6^ n\) such that every graph with n vertices is isomorphic to C(G(n),S(n)) for some subset S(n) (depending on the graph) with n elements of G(n). [Compare also with \textit{R. Scapellato}, Commutativity graphs of groups, Rend. Accad. Naz. Sci. Detta XL, V. Ser. 12, No.1, 333-347 (1988; see review 05026 in this volume).]
Recommendations
Cites work
Cited in
(6)- The genus of the product of a group with an Abelian group
- Realizability problem for commuting graphs
- Graph cycles and diagram commutativity
- On the lower bound for diameter of commuting graph of prime-square sized matrices
- scientific article; zbMATH DE number 4193698 (Why is no real title available?)
- Group extensions and graphs.
This page was built for publication: Universal commutator graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2276972)