Cohen-Macaulay graphs arising from digraphs
Commutative Algebra
2007-05-23 v1 Combinatorics
Abstract
In this paper we show a correspondence between directed graphs and bipartite undirected graphs with a perfect matching, that allows to study properties of directed graphs through the properties of the corresponding undirected graphs. In particular it is shown that a directed graph is transitive iff a corresponding undirected graph is Cohen-Macaulay.
Keywords
Cite
@article{arxiv.math/0703417,
title = {Cohen-Macaulay graphs arising from digraphs},
author = {Giuseppa Carrá Ferro and Daniela Ferrarello},
journal= {arXiv preprint arXiv:math/0703417},
year = {2007}
}
Comments
20 pages