اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدProjective dimension and regularity of edge ideals of some vertex-weighted oriented $m$-partite graphs
172
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we provide some exact formulas for the projective dimension and the regularity of edge ideals associated to three special types of vertex-weighted oriented $m$-partite graphs. These formulas are functions of the weight and number of vertices. We also give some examples to show that these formulas are related to direction selection and the weight of vertices.
قيم البحث
اقرأ أيضاً
In this paper we provide some exact formulas for projective dimension and the regularity of powers of edge ideals of vertex-weighted rooted forests. These formulas are functions of the weight of the vertices and the number of edges. We also give some
examples to show that these formulas are related to direction selection and the assumptions about rooted forest such that $w(x)geq 2$ if $d(x) eq 1$ cannot be dropped.
In this paper we provide some precise formulas for regularity of powers of edge ideal of the disjoint union of some weighted oriented gap-free bipartite graphs. For the projective dimension of such an edge ideal, we give its exact formula. Meanwhile,
we also give the upper and lower bounds of projective dimension of higher power of such edge ideals. Some examples show that these formulas are related to direction selection.
Let $mathcal{D}$ be a weighted oriented graph and $I(mathcal{D})$ be its edge ideal. In this paper, we show that all the symbolic and ordinary powers of $I(mathcal{D})$ coincide when $mathcal{D}$ is a weighted oriented certain class of tree. Fi
nally, we give necessary and sufficient conditions for the equality of ordinary and symbolic powers of naturally oriented lines.
Let $mathcal{D}$ be a weighted oriented graph and let $I(mathcal{D})$ be its edge ideal. Under a natural condition that the underlying (undirected) graph of $mathcal{D}$ contains a perfect matching consisting of leaves, we provide several equivalent
conditions for the Cohen-Macaulayness of $I(mathcal{D})$. We also completely characterize the Cohen-Macaulayness of $I(mathcal{D})$ when the underlying graph of $mathcal{D}$ is a bipartite graph. When $I(mathcal{D})$ fails to be Cohen-Macaulay, we give an instance where $I(mathcal{D})$ is shown to be sequentially Cohen-Macaulay.
Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial characterization
for the unmixed property of I, when D is bipartite, D is a whisker or D is a cycle. Finally, we study the Cohen-Macaulay property of I.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
