Permutation graphs and the weak Bruhat order

dc.date.accessioned	2023-01-28T16:28:18Z
dc.date.available	2023-01-28T16:28:18Z
dc.date.created	2023-01-13T18:31:40Z
dc.date.issued	2023
dc.identifier.citation	Brualdi, R.A. Dahl, Geir . Permutation graphs and the weak Bruhat order. The Art of Discrete and Applied Mathematics. 2023
dc.identifier.uri	http://hdl.handle.net/10852/99375
dc.description.abstract	Permutation graphs are graphs associated with permutations where edges represent inversions. We study different classes of permutation graphs and isomorphic permutation graphs. A complete answer of a basic isomorphism question is given for trees. A connection to the majorization order for integer partitions is established, in connection with the notion of inversion vectors. Finally, we study special transitivity properties related to inversions of permutations.
dc.language	EN
dc.rights	Attribution 4.0 International
dc.rights.uri	https://creativecommons.org/licenses/by/4.0/
dc.title	Permutation graphs and the weak Bruhat order
dc.title.alternative	ENEngelskEnglishPermutation graphs and the weak Bruhat order
dc.type	Journal article
dc.creator.author	Brualdi, R.A.
dc.creator.author	Dahl, Geir
cristin.unitcode	185,15,13,0
cristin.unitname	Matematisk institutt
cristin.ispublished	false
cristin.fulltext	original
dc.identifier.cristin	2106898
dc.identifier.bibliographiccitation	info:ofi/fmt:kev:mtx:ctx&ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=The Art of Discrete and Applied Mathematics&rft.volume=&rft.spage=&rft.date=2023
dc.identifier.jtitle	The Art of Discrete and Applied Mathematics
dc.identifier.doi	https://doi.org/10.26493/2590-9770.1536.8db
dc.type.document	Tidsskriftartikkel
dc.type.peerreviewed	Peer reviewed
dc.source.issn	2590-9770
dc.type.version	AcceptedVersion