Enhanced power graphs of groups are weakly perfect
From MaRDI portal
Abstract: A graph is weakly perfect if its clique number and chromatic number are equal. We show that the enhanced power graph of a finite group is weakly perfect: its clique number and chromatic number are equal to the maximum order of an element of . The proof requires a combinatorial lemma. We give some remarks about related graphs.
Recommendations
Cites work
- A study of enhanced power graphs of finite groups
- A Theorem of Sylvester and Schur
- Criterion of unrecognizability of a finite group by its Gruenberg-Kegel graph
- Directed graphs and combinatorial properties of semigroups
- scientific article; zbMATH DE number 3065933 (Why is no real title available?)
- On the structure of the power graph and the enhanced power graph of a group
- Prime graph components of finite groups
- PRIME GRAPH COMPONENTS OF FINITE SIMPLE GROUPS
- Recent developments on the power graph of finite groups -- a survey
- The full automorphism group of the power (di)graph of a finite group
- The strong perfect graph theorem
- Undirected power graphs of semigroups
Cited in
(4)
This page was built for publication: Enhanced power graphs of groups are weakly perfect
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060446)