Path Ideals of Weighted Graphs
Commutative Algebra
2014-08-08 v1 Combinatorics
Abstract
We introduce and study the weighted -path ideal of a weighted graph , which is a common generalization of Conca and De Negri's -path ideal for unweighted graphs and Paulsen and Sather-Wagstaff's edge ideal of the weighted graph. Over a field, we explicitly describe primary decompositions of these ideals, and we characterize Cohen-Macaulayness of these ideals for trees (with arbitrary ) and complete graphs (for ).
Cite
@article{arxiv.1408.1674,
title = {Path Ideals of Weighted Graphs},
author = {Bethany Kubik and Sean Sather-Wagstaff},
journal= {arXiv preprint arXiv:1408.1674},
year = {2014}
}
Comments
24 pages