2
Institute for Advanced Studies in Basic Sciences
Abstract
In this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
Madadi, A., & Zaare-Nahandi, R. (2014). Cohen-Macaulay $r$-partite graphs with minimal clique cover. Bulletin of the Iranian Mathematical Society, 40(3), 609-617.
MLA
Madadi, A., & Zaare-Nahandi, R. "Cohen-Macaulay $r$-partite graphs with minimal clique cover", Bulletin of the Iranian Mathematical Society, 40, 3, 2014, 609-617.
HARVARD
Madadi A., Zaare-Nahandi R. (2014). 'Cohen-Macaulay $r$-partite graphs with minimal clique cover', Bulletin of the Iranian Mathematical Society, 40(3), pp. 609-617.
CHICAGO
A. Madadi & R. Zaare-Nahandi, "Cohen-Macaulay $r$-partite graphs with minimal clique cover," Bulletin of the Iranian Mathematical Society, 40 3 (2014): 609-617,
VANCOUVER
Madadi A., Zaare-Nahandi R. Cohen-Macaulay $r$-partite graphs with minimal clique cover. BIMS. 2014;40(3):609-617.
