Enhanced power graphs of groups are weakly perfect

Autor:	Cameron, Peter J., Phan, Veronica
Přispěvatelé:	University of St Andrews. Pure Mathematics, University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra
Jazyk:	angličtina
Rok vydání:	2022
Předmět:	MCC Mathematics(all) T-NDAS Group Theory (math.GR) Weakly perfect graph 05C25 Computer Science::Discrete Mathematics FOS: Mathematics NCAD Mathematics - Combinatorics Enhanced power graph Combinatorics (math.CO) QA Mathematics Finite group QA Mathematics - Group Theory
Popis:	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 G is weakly perfect: its clique number and chromatic number are equal to the maximum order of an element of G. The proof requires a combinatorial lemma. We give some remarks about related graphs. Publisher PDF
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f0579d38b54981023a79155aa7e17eb https://ajc.maths.uq.edu.au/?page=get_volumes&volume=85 Zobrazit plný text záznamu