Perfect commuting graphs
Let \(G\) be a finite group. The commuting graph of \(G\) is the graph \(\Gamma(G)\) with vertices being the elements of \(G - Z(G)\), and two vertices are adjacent if and only if they commute. This graph has been studied quite a bit recently, and the authors add to this by classifying all finite quasisimple groups whose commuting graph is perfect. (Recall that a graph is called perfect if the chromatic number and clique number coincide for every induced subgraph.) The second main result of the paper studies arbitrary finite groups with perfect commuting graphs. For example, such groups have at most two components, and if there are exactly two components, the possible structures of these are listed.
- A characterization of perfect graphs
- A characterization of the one-dimensional unimodular projective groups over finite fields
- scientific article; zbMATH DE number 4130647 (Why is no real title available?)
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 3179511 (Why is no real title available?)
- scientific article; zbMATH DE number 46357 (Why is no real title available?)
- scientific article; zbMATH DE number 1111401 (Why is no real title available?)
- Imprimitive irreducible modules for finite quasisimple groups
- Maximal subsets of pairwise non-commuting elements of some finite \(p\)-groups.
- Nilpotent covers and non-nilpotent subsets of finite groups of Lie type
- Non-commuting graph of a group.
- On a class of doubly transitive groups
- ON THE COMMUTING GRAPH ASSOCIATED WITH THE SYMMETRIC AND ALTERNATING GROUPS
- On the diameters of commuting graphs arising from random skew-symmetric matrices.
- On the Overgroups of Irreducible Subgroups of the Finite Classical Groups
- Prime graph components of finite groups
- Prime graph components of the simple groups of Lie type over the field of even characteristic
- The classification of the finite simple groups
- The diameter of the commuting graph of a finite group with trivial centre.
- The Magma algebra system. I: The user language
- The maximal subgroups of the Chevalley groups \(G_ 2(q)\) with q odd, the Ree groups \(2G_ 2(q)\), and their automorphism groups
- The maximal subgroups of the Steinberg triality groups \(3D_ 4(q)\) and their automorphism groups
- The Nonexistence of a Certain Type of Simple Groups of Odd Order
- The strong perfect graph theorem
- There is no upper bound for the diameter of the commuting graph of a finite group
- Matchings in graphs and groups
- A combinatorial characterization of finite groups of prime exponent
- On \(\pi\)-product involution graphs in symmetric groups
- Characterization of groups with planar, toroidal or projective planar (proper) reduced power graphs
- Group partitions via commutativity
- Graphs defined on groups
- Some properties of various graphs associated with finite groups
- Commuting involution graphs for 4-dimensional projective symplectic groups
- A graph related to the sum of element orders of a finite group
- Perfect codes in commuting graphs of symmetric groups
- The commuting graphs of certain cyclic-by-abelian groups
- Properties of commuting graphs over finite non-abelian groups
- Critical groups and partitions of finite groups
- Characterizing finite nilpotent groups associated with a graph theoretic equality
- Nilpotent groups whose difference graphs have positive genus
- What can graphs and algebraic structures say to each other?
- Aspects of the commuting graph
- Commuting graph of A -orbits
This page was built for publication: Perfect commuting graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528911)
