Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorCameron, Peter J.
dc.contributor.authorPhan, Veronica
dc.date.accessioned2022-12-02T12:30:08Z
dc.date.available2022-12-02T12:30:08Z
dc.date.issued2023-02-01
dc.identifier281643817
dc.identifier039d2c3a-edae-4594-acac-28a65c039554
dc.identifier85142809109
dc.identifier000891433100008
dc.identifier.citationCameron , 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.issn2202-3518
dc.identifier.otherORCID: /0000-0003-3130-9505/work/124078640
dc.identifier.urihttps://hdl.handle.net/10023/26528
dc.description.abstractA 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.extent6
dc.format.extent81300
dc.language.isoeng
dc.relation.ispartofAustralasian Journal of Combinatoricsen
dc.subjectEnhanced power graphen
dc.subjectWeakly perfect graphen
dc.subjectFinite groupen
dc.subjectQA Mathematicsen
dc.subjectMathematics(all)en
dc.subjectT-NDASen
dc.subjectNCADen
dc.subjectMCCen
dc.subject.lccQAen
dc.titleEnhanced power graphs of groups are weakly perfecten
dc.typeJournal articleen
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.description.statusPeer revieweden
dc.date.embargoedUntil2022-11-29
dc.identifier.urlhttps://ajc.maths.uq.edu.au/?page=get_volumes&volume=85en
dc.identifier.urlhttps://arxiv.org/abs/2207.07156en


This item appears in the following Collection(s)

Show simple item record