Files in this item
Enhanced power graphs of groups are weakly perfect
Item metadata
dc.contributor.author | Cameron, Peter J. | |
dc.contributor.author | Phan, Veronica | |
dc.date.accessioned | 2022-12-02T12:30:08Z | |
dc.date.available | 2022-12-02T12:30:08Z | |
dc.date.issued | 2023-02-01 | |
dc.identifier.citation | Cameron , P J & Phan , V 2023 , ' Enhanced power graphs of groups are weakly perfect ' , Australasian Journal of Combinatorics , vol. 85 , no. 1 , pp. 100-105 . | en |
dc.identifier.issn | 2202-3518 | |
dc.identifier.other | PURE: 281643817 | |
dc.identifier.other | PURE UUID: 039d2c3a-edae-4594-acac-28a65c039554 | |
dc.identifier.other | ORCID: /0000-0003-3130-9505/work/124078640 | |
dc.identifier.other | Scopus: 85142809109 | |
dc.identifier.other | WOS: 000891433100008 | |
dc.identifier.uri | http://hdl.handle.net/10023/26528 | |
dc.description.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 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. | |
dc.format.extent | 6 | |
dc.language.iso | eng | |
dc.relation.ispartof | Australasian Journal of Combinatorics | en |
dc.rights | Copyright © The author(s). Released under the CC BY 4.0 International License. | en |
dc.subject | Enhanced power graph | en |
dc.subject | Weakly perfect graph | en |
dc.subject | Finite group | en |
dc.subject | QA Mathematics | en |
dc.subject | Mathematics(all) | en |
dc.subject | T-NDAS | en |
dc.subject | NCAD | en |
dc.subject | MCC | en |
dc.subject.lcc | QA | en |
dc.title | Enhanced power graphs of groups are weakly perfect | en |
dc.type | Journal article | en |
dc.description.version | Publisher PDF | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.description.status | Peer reviewed | en |
dc.date.embargoedUntil | 2022-11-29 | |
dc.identifier.url | https://ajc.maths.uq.edu.au/?page=get_volumes&volume=85 | en |
dc.identifier.url | https://arxiv.org/abs/2207.07156 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.