| dc.contributor.author |
Cheri, P. V. |
|
| dc.contributor.author |
Dey, Deblina |
|
| dc.contributor.author |
K, Akhil |
|
| dc.contributor.author |
Kotal, Nirmal |
|
| dc.contributor.author |
Veer, Dharm |
|
| dc.coverage.spatial |
United States of America |
|
| dc.date.accessioned |
2023-11-09T11:13:00Z |
|
| dc.date.available |
2023-11-09T11:13:00Z |
|
| dc.date.issued |
2023-10 |
|
| dc.identifier.citation |
Cheri, P. V.; Dey, Deblina; K, Akhil; Kotal, Nirmal and Veer, Dharm, "Cohen-Macaulay permutation graphs", arXiv, Cornell University Library, DOI: arXiv:2310.17343, Oct. 2023. |
|
| dc.identifier.issn |
2331-8422 |
|
| dc.identifier.uri |
https://doi.org/10.48550/arXiv.2310.17343 |
|
| dc.identifier.uri |
https://repository.iitgn.ac.in/handle/123456789/9438 |
|
| dc.description.abstract |
In this article, we characterize Cohen-Macaulay permutation graphs. In particular, we show that a permutation graph is Cohen-Macaulay if and only if it is well-covered and there exists a unique way of partitioning its vertex set into r disjoint maximal cliques, where r is the cardinality of a maximal independent set of the graph. We also provide some sufficient conditions for a comparability graph to be a uniquely partially orderable (UPO) graph. |
|
| dc.description.statementofresponsibility |
by P. V. Cheri, Deblina Dey, Akhil K, Nirmal Kotal and Dharm Veer |
|
| dc.language.iso |
en_US |
|
| dc.publisher |
Cornell University Library |
|
| dc.title |
Cohen-Macaulay permutation graphs |
|
| dc.type |
Article |
|
| dc.relation.journal |
arXiv |
|