Research article Special Issues

Algebraic invariants of edge ideals of some bristled circulant graphs

  • Let S be a polynomial ring over a field K and I be the edge ideal associated with the bristled graph of some four or five regular circulant graph. We discuss the depth, projective dimension, regularity and Stanley depth of S/I.

    Citation: Ibad Ur Rehman, Mujahid Ullah Khan Afridi, Muhammad Ishaq, Asim Asiri, Aftab Hussain. Algebraic invariants of edge ideals of some bristled circulant graphs[J]. AIMS Mathematics, 2025, 10(5): 11330-11348. doi: 10.3934/math.2025515

    Related Papers:

    [1] Bakhtawar Shaukat, Muhammad Ishaq, Ahtsham Ul Haq . Algebraic invariants of edge ideals of some circulant graphs. AIMS Mathematics, 2024, 9(1): 868-895. doi: 10.3934/math.2024044
    [2] Tazeen Ayesha, Muhammad Ishaq . Some algebraic invariants of the edge ideals of perfect $ [h, d] $-ary trees and some unicyclic graphs. AIMS Mathematics, 2023, 8(5): 10947-10977. doi: 10.3934/math.2023555
    [3] Naeem Ud Din, Muhammad Ishaq, Zunaira Sajid . Values and bounds for depth and Stanley depth of some classes of edge ideals. AIMS Mathematics, 2021, 6(8): 8544-8566. doi: 10.3934/math.2021496
    [4] Zahid Iqbal, Muhammad Ishaq . Depth and Stanley depth of edge ideals associated to some line graphs. AIMS Mathematics, 2019, 4(3): 686-698. doi: 10.3934/math.2019.3.686
    [5] Malik Muhammad Suleman Shahid, Muhammad Ishaq, Anuwat Jirawattanapanit, Khanyaluck Subkrajang . Depth and Stanley depth of the edge ideals of multi triangular snake and multi triangular ouroboros snake graphs. AIMS Mathematics, 2022, 7(9): 16449-16463. doi: 10.3934/math.2022900
    [6] Jovanny Ibarguen, Daniel S. Moran, Carlos E. Valencia, Rafael H. Villarreal . The signature of a monomial ideal. AIMS Mathematics, 2024, 9(10): 27955-27978. doi: 10.3934/math.20241357
    [7] Tariq Alraqad, Hicham Saber, Rashid Abu-Dawwas . Intersection graphs of graded ideals of graded rings. AIMS Mathematics, 2021, 6(10): 10355-10368. doi: 10.3934/math.2021600
    [8] Pradeep Singh, Sahil Sharma, Sunny Kumar Sharma, Vijay Kumar Bhat . Metric dimension and edge metric dimension of windmill graphs. AIMS Mathematics, 2021, 6(9): 9138-9153. doi: 10.3934/math.2021531
    [9] S. Masih Ayat, S. Majid Ayat, Meysam Ghahramani . The independence number of circulant triangle-free graphs. AIMS Mathematics, 2020, 5(4): 3741-3750. doi: 10.3934/math.2020242
    [10] Fida Moh'd, Mamoon Ahmed . Simple-intersection graphs of rings. AIMS Mathematics, 2023, 8(1): 1040-1054. doi: 10.3934/math.2023051
  • Let S be a polynomial ring over a field K and I be the edge ideal associated with the bristled graph of some four or five regular circulant graph. We discuss the depth, projective dimension, regularity and Stanley depth of S/I.



    Let S=K[e1,,el] be the polynomial ring over the field K, equipped with the standard grading. Let M be a finitely generated graded S-module and suppose that M has the following minimal free resolution:

    0 jZS(j)βr,j(M)jZS(j)βr1,j(M)jZS(j)β0,j(M)M 0.

    Let us denote the Castelnuovo-Mumford regularity of a module M as reg(M). Then, reg(M)=max{ji:βi,j(M)0}. The projective dimension of a module M, denoted as pdim(M), is defined as pdim(M)=max{i:βi,j(M)0}.

    Let G=(V(G),E(G)), be a graph with vertex set V(G)={e1,,el} and edge set E(G). All graphs considered in this paper are simple, finite, and undirected. The degree of a vertex is the number of edges incident on it. The edge ideal of a graph G is the squarefree monomial ideal I(G)=(eiej:{ei,ej}E(G)). If I is a monomial ideal and G(I) represents the minimal system of monomial generators of I, then supp(I):={ ei:ei|a for some aG(I)}. For mR, m:=max{bZ:bm} and m:=min{bZ:bm}. Let l2 be an integer and A be a subset of {1,,l2}. A circulant graph Cl(A) is a graph with vertex set {e1,,el} such that {ei,ej}E(Cl(A)) if and only if |ij|A or l-|ij|A. It is worth noting that Cl(A) can be considered as a generalized cycle since Cl=Cl({1}). For simplicity, the graph Cl({b1,,bm}) is denoted as Cl(b1,,bm). A circulant graph Cl(b1,,bm) is 2m regular, except in the case when 2bm=l, in which case it is (2m1) regular. Let t1, and G be a graph. Then, the graph G is called the t-fold bristled graph of G if we add t pendants to each vertex of the graph G. For a graph G, the t-fold bristled graph of G is denoted by Brt(G). There are many applications of circulant graphs in group theory [1] and network theory [2, 3].

    This paper draws inspiration from the recent work of Shaukat et al. [4], which specifically explores the algebraic invariants of the residue class rings of the edge ideals of some four and five regular circulant graphs, namely, C2n(1,n1), C2n(1,2), and C2n(1,n1,n), where n3. For n3 and t1, if Dn,t, En,t, and Fn,t represent the bristled graphs of these graphs, respectively, then Dn,t:=Brt(C2n(1,n1)), En,t:=Brt(C2n(1,2)), and Fn,t:=Brt(C2n(1,n1,n)). This study aims to investigate the regularity, depth, and Stanley depth of the residue class rings of the edge ideals of Dn,t, En,t, and Fn,t. These graphs are shown in Figures 1 and 2. Before proving our main results, we further require investigating the said algebraic invariants of the residue class rings of the edge ideals of various subgraphs of these graphs. These supporting results are obtained in Section 3. We prove our main results in Section 4. We prove the following main theorems for regularity.

    Theorem 1.1. Let n3, t1, and S=K[V(Dn,t)]. Then,

    reg(S/I(Dn,t))={n,if n is even;n1,if n is odd.

    Theorem 1.2. Let n3, t1, and S=K[V(En,t)]. Then,

    reg(S/I(En,t))={2n13,if n0,1(mod3);2n131,if n2(mod3),

    Theorem 1.3. Let n3, t1, and S=K[V(Fn,t)]. Then,

    reg(S/I(Fn,t))=n12.

    We prove the following main result for depth and Stanley depth.

    Theorem 1.4. Let n3, and S=K[V(Dn,t)]. Then,

    sdepth(S/I(Dn,t))depth(S/I(Dn,t))={n(t+1),if n is odd;n(t+1)+t1,if n is even.
    Figure 1.  From left to right Dn,2 and En,2.
    Figure 2.  Fn,2.

    We acknowledge the use of CoCoA [5] and Macaulay2 [6] during our experimental calculations. These software tools have limitations when generators of the edge ideal increases. In such scenarios, additional mathematical calculations and theoretical frameworks are necessary to compute the algebraic invariants that cannot be computed by these software packages.

    In this section, we present some definitions and findings that are extensively used in the subsequent sections of this paper. Let M be a finitely generated Zl-graded S-module. A Stanley decomposition of M is a presentation of the K-vector space M as a finite direct sum:

    T:M=zj=1ujK[Wj],

    where ujM is a homogeneous element, Wj{e1,,el}, and ujK[Wj] is a K-subspace of M generated by ujb, where b is a monomial in K[Wj]. The Zl-graded K-subspace ujK[Wj] of M is called a Stanley space of dimension |Wj| if ujK[Wj] is a free K[Wj]-module. The Stanley depth of T is defined as sdepth(T)=min{|Wj|:j=1,,z}, and the Stanley depth of M is defined as sdepth(M)=max{sdepth(T):T is a Stanley decomposition of M}. In 1982, Stanley conjectured in [7] that for a Zl-graded module M, sdepth(M)depth(M). In 2016, Duval et al. disproved this conjecture in [8] by providing a counter example. Stanley depth has gained attention, particularly when Herzog et al. presented an algorithm in [9] for computing sdepth(M) for modules of the form M=Q1/Q2, where Q2Q1S are monomial ideals. This algorithm is useful for studying Stanley depth in certain special cases. However, calculating Stanley depth using this algorithm is generally a challenging combinatorial problem. Therefore, finding Stanley depth for particular classes of modules is useful, see for instance [10, 11, 12].

    Lemma 2.1. ([13, Lemma 3.3]). Let IS be a squarefree monomial ideal such that supp(I)={e1,e2,,el}. Suppose β:=ei1ei2eirS/I and ejβI for all ej{e1,e2,,el}supp(β). Then, sdepth(S/I)r.

    The following lemmas are important for finding lower bounds for depth and Stanley depth of modules.

    Lemma 2.2 ([14]). If 0MMM0 is a short exact sequence of modules over a Noetherian graded ring with S0 local, or a local ring S, then

    (a) depth(M)min{depth(M),depth(M)}.

    (b) depth(M)min{depth(M),depth(M)+1}.

    (c) depth(M)min{depth(M)1,depth(M)}.

    Lemma 2.3. ([15, Lemma 2.2]). Let 0MMM0 be a short exact sequence of a Zl-graded S-module. Then, sdepth(M)min{sdepth(M),sdepth(M)}.

    Lemma 2.4. ([16, Theorem 4.7]). If I is a monomial ideal and e is a variable in S, then

    (a) reg(S/I)=1+reg(S/(I:e)), if reg(S/(I,e))<reg(S/(I:e)).

    (b) reg(S/I)=reg(S/(I,e)) if reg(S/(I:e))<reg(S/(I,e)).

    (c) reg(S/I){reg(S/(I,e)),reg(S/(I,e))+1}, if reg(S/(I:e))=reg(S/(I,e)).

    Lemma 2.5. ([17, Proposition 2.2.20]). Let I1 and I2 be monomial ideals, I1S=K[e1,,ep] and I2S=K[ep+1,,el], where 1p<l, and S=SKS. Then, S/(I1+I2)S/I1KS/I2.

    Lemma 2.6. ([17, Proposition 2.2.21]). Let I1S=K[e1,,ep], I2S=K[ep+1,,el] be monomial ideals, where 1p<l. If S=SKS, then

    depth(S/I1KS/I2)=depth(S/(I1S+I2S)))=depthS(S/I1)+depthS(S/I2).

    A vertex of degree one in a graph is termed as a pendant vertex or leaf. A vertex that is not a leaf is called an internal vertex. For r2, a star graph denoted as Sr is a graph with one internal vertex and r leaves connected to it. For p2, a path on p vertices is denoted as Pp, and for p3 a cycle on p vertices is denoted as Cp. Let Sp,t:=Brt(Pp) and Cp,t:=Brt(Cp).

    Lemma 2.7 ([18]). Let S=K[V(Sr)] and I=I(Sr). Then,

    depth(S/I)=reg(S/I)=sdepth(S/I)=1.

    Lemma 2.8. ([19, Theorem 2.28]). Let S=K[V(Sp,t)] and I=I(Sp,t). Then,

    (a) reg(S/I)=p2.

    (b) depth(S/I)=sdepth(S/I)=p2+p12t.

    Lemma 2.9. ([19, Theorem 2.30 and Theorm 2.9]). Let S=K[V(Cp,t)] and I=I(Cp,t). Then,

    (a) reg(S/I)=p12.

    (b) depth(S/I)=sdepth(S/I)=p12+p2t.

    Lemma 2.10. ([15, Corollary 1.3] and [20, Proposition 2.7]). Let IS be a monomial ideal. Then, for all monomials aI,

    (a) depth(S/(I:a))depth(S/I).

    (b) sdepth(S/I)sdepth(S/(I:a)).

    Lemma 2.11. ([21, Lemma 2.13]). Let I1S=K[e1,,ep], I2S=K[ep+1,,el] be monomial ideals, where 1p<l and S=SKS. Then,

    sdepth(S/I1KS/I2)=sdepth(S/(I1S+I2S))sdepthS(S/I1)+sdepthS(S/I2).

    Lemma 2.12. ([9, Lemma 3.6] and [22, Lemma 3.5]). Let IS be a monomial ideal. If S=SKK[el+1]S[el+1], then

    (a) depth(S/IS)=depth(S/I)+1.

    (b) sdepth(S/IS)=sdepth(S/I)+1.

    (c) reg(S/IS)=reg(S/I).

    The following lemma is proved by Kalai et al. [23, Theorem 1.4] for squarefree monomial ideals. Herzog further extended this result to any monomial ideal [24, Corollary 3.2].

    Lemma 2.13. For monomial ideals I1 and I2 of S, reg(S/(I1+I2))reg(S/I1)+reg(S/I2).

    A graph G is a weakly chordal graph if neither G nor its complement graph Gc contain an induced cycle of length n5. A matching, denoted by M, in a graph G is a subset of E(G) where there is no common vertex between any pair of edges. A matching that forms an induced subgraph of G is referred to as a induced matching in G. Furthermore, indmat(G) represents the induced matching number of graph G, which is defined as follows: indmat(G)=max{|M|:M is an induced matching in G}.

    Lemma 2.14. ([25, Lemma 2.2] and [26, Corollary 6.9]). For a finite simple graph G, reg(S/I(G))indmat(G). Furthermore, for a chordal graph G, indmat(G)=reg(S/I(G)).

    Lemma 2.15. ([27, Theorem 14]). For a weakly chordal graph G, indmat(G)=reg(S/I(G)).

    Lemma 2.16. ([28, Lemma 3.2]). Let 1p<l. If I1S=K[e1,,ep] and I2S= K[ep+1,,el] are non-zero homogeneous ideals of S and S and we regard I1+I2 as a homogeneous ideal of S=SKS, then

    reg(S/(I1+I2))=reg(S/I1)+reg(S/I2).

    For n1, let An, Bn, and Cn be subgraphs of C2n(1,n1), C2n(1,2), and C2n(1,n1,n), respectively. Subgraphs An, Bn, and Cn are shown in Figures 3 and 4. Let us denote the the t-fold bristled graphs of An, Bn, and Cn as follows: An,t:=Brt(An), Bn,t:=Brt(Bn), and Cn,t:=Brt(Cn).

    Figure 3.  From left to right An and Bn..
    Figure 4.  Cn.

    In this section, we compute the regularity of the cyclic modules K[V(An,t)]/I(An,t), K[V(Bn,t)]/I(Bn,t), and K[V(Cn,t)]/I(Cn,t). We also compute depth, Stanley depth, and projective dimension of K[V(An,t)]/I(An,t). These results are crucial for our main findings in the next section. Let IS be a squarefree monomial ideal that is minimally generated by monomials of degree at most 2. We define a graph GI associated with the ideal I, where V(GI)=supp(I) and E(GI)={{ei,ej}:eiejG(I)}. Examples of G(I(A6,2):f6) and G(I(A6,2),f6,e6) are given in Figure 5. These graphs help us to understand the following isomorphisms:

    K[V(A6,2)]/(I(A6,2):f6)K[V(A4,2)]/I(A4,2)KK[V(S2)]/I(S2)KK[f6,f5,1,f5,2,e5,1,e5,2],
    K[V(A6,2)]/(I(A6,2),f6,e6)K[V(A5,2)]/I(A5,2)KK[f6,1,f6,2,e6,1,e6,2].

    Remark 3.1. We may have the following special cases in our proofs. These special cases are fixed as follows:

    K[V(A0,t)]/I(A0,t):≅K. Thus, reg(K[V(A0,t)]/I(A0,t))=depth(K[V(A0,t)]/I(A0,t))=sdepth(K[V(A0,t)]/I(A0,t))=0

    K[V(B0,t)]/I(B0,t):≅K. Thus, reg(K[V(B0,t)]/I(B0,t))=depth(K[V(B0,t)]/I(B0,t))=sdepth(K[V(B0,t)]/I(B0,t))=0

    K[V(C0,t)]/I(C0,t):≅K. Thus, reg(K[V(C0,t)]/I(C0,t))=depth(K[V(C0,t)]/I(C0,t))=sdepth(K[V(C0,t)]/I(C0,t))=0.

    If n=1, then K[V(A1,t)]/I(A1,t):≅K[V(St)]/I(St)KK[V(St)]/I(St). By Lemmas 2.7 and 2.16, reg(K[V(A1,t)]/I(A1,t))=2. $

    Lemma 3.2. ([11, Lemma 3.6]). Let G be a graph. Then, Brt(G) is weakly chordal if and only if G is weakly chordal.

    Figure 5.  From left to right G(I(A6,2):f6) and G(I(A6,2),f6,e6).

    Let G be a graph and QV(G), where Q is called an independent set if no two vertices in Q are adjacent in G. A maximum independent set is an independent set of the largest possible size. The cardinality of the maximum independent set is called the independence number of G and is denoted by α(G).

    Lemma 3.3. ([11, Lemma 3.7]). If G is a graph, then indmat(Brt(G))=α(G).

    Lemma 3.4. Let n,t1, S=K[V(An,t)] and I=I(An,t). Then,

    reg(S/I)={n+1,ifnisodd;n,ifniseven.

    Proof. Let EV(An) such that E={e1,f1,e3,f3,,en1,fn1} if n is even, and E={e1,f1,e3,f3,,en,fn} if n is odd. One can easily see that E is a maximum independent set of An, |E|=n when n is even, and |E|=n+1 when n is odd. Since An is a weakly chordal graph, then by Lemma 3.2, An,t is a weakly chordal graph. Thus, by applying Lemmas 3.3 and 2.15, the required result follows.

    Lemma 3.5. For n,t1, S=K[V(Bn,t)] and I=I(Bn,t). Then,

    reg(S/I)={2n13+1,ifn=1mod(3)2n3,ifn=0,2mod(3)

    Proof. The proof of this lemma is similar to the proof of Lemma 3.4. If |E| is a maximum independent set, then E is of the form:

    1) E={f1,e2,f4,e5,,fn2,en1}, when n=0mod(3); and so |E|=2n3.

    2) E={f1,e2,f4,e5,,en2,fn}, when n=1mod(3); and so |E|=2n13+1.

    3) E={f1,e2,f4,e5,,fn1,en}, when n=2mod(3), and so |E|=2n3.

    Lemma 3.6. Let n,t1, S=K[V(Cn,t)] and I=I(Cn,t). Then, reg(S/I(Cn,t))=n2.

    Proof. The proof is similar to the proof of Lemma 3.4.

    If G is a graph and ei is a vertex of G, then in Brt(G) the newly added t pedants to vertex ei are labeled as ei,1,ei,2,,ei,t.

    Lemma 3.7. Let n2, t1, and S=K[V(An,t)]. Then,

    sdepth(S/I(An,t))depth(S/I(An,t))={n(t+1),if n is even;n(1+t)t+1,if n is odd.

    Proof. If n=2, then we have the following short exact sequence:

    0S/(I(A2,t):f2)f2S/I(A2,t)S/(I(A2,t),f2)0, (3.1)

    and

    S/(I(A2,t):f2)K[V(St)]/I(St)KK[f2,f1,1,,f1,t,e1,1,,e1,t],S/(I(A2,t),f2)K[V(S3,t)]/I(S3,t)KK[f2,1,,f2,t].

    By Lemmas 2.6 and 2.12, depth(S/(I(A2,t):f2))=depth(V(St)]/I(St))+1+t+t, and depth(S/(I(A2,t),f2))=depth(K[V(S3,t)]/I(S3,t))+t. By applying Lemmas 2.7 and 2.8, depth(S/I(A2,t):f2)=2t+2, and depth(S/(I(A2,t),f2))=2+t+t=2t+2. By Lemmas 2.2 and 2.10 along with the use of the short exact sequence 3.1, depth(S/I(A2,t))=2t+2. Let n3. Considering the short exact sequence:

    0S/(I(An,t):fn)fnS/I(An,t)S/(I(An,t),fn)0,

    we have

    S/(I(An,t):fn)K[V(An2)]/I(An2)KK[V(St)]/I(St)]KK[fn,fn1,1,,fn1,t,en1,1,,en1,t]. (3.2)

    Let

    L:=(I(An,t),fn)=(I(An1,t),fn,fn1en,enen1,enen,1,,enen,t).

    We consider another short exact sequence

    0S/(L:en)enS/LS/(L,en)0,

    and it is easy to see that

    S/(L:en)K[V(An2,t)]/I(An2,t)KK[en,fn1,1,,fn1,t,en1,1,,en1,t], (3.3)
    S/(L,en)K[V(An1,t)]/I(An1,t)KK[en,1,,en,t,fn,1,,fn,t]. (3.4)

    Case 1: If n is odd, then applying Lemmas 2.6 and 2.12 on Eqs (3.2)–(3.4),

    depth(S/(I(An,t):fn))=depth(K[V(An2,t)]/I(An2,t))+depth(K[V(St)]/I(St))+1+2t,
    depth(S/(L,en))=depth(K[V(An1,t)]/I(An1,t))+2t,
    depth(S/(L:en))=depth(K[V(An2,t)]/I(An2,t))+3t.

    By mathematical induction on n along with the use of Lemma 2.7,

    depth(S/(I(An,t):fn))=(n2)(1+t)t+1+1+1+2t=n(t+1)t+1, (3.5)
    depth(S/(L,en))=(n1)(t+1)+2t=n(1+t)+t1, (3.6)
    depth(S/(L:en))=(t+1)(n2)t+2+t+2t=n(1+t). (3.7)

    Using Lemmas 2.2 and 2.10 on Eqs 3.6 and 3.7,

    depth(S/I(An,t),fn))=n(t+1). (3.8)

    By applying Lemmas 2.2 and 2.10 on Eqs (3.5) and (3.8), we get

    depth(S/I(An,t))=n(t+1)t+1.

    Case 2: If n is even, then by applying Lemmas 2.6 and 2.12 on Eqs (3.2)–(3.4), we have

    depth(S/(I(An,t):fn))=depth(K[V(An2,t)]/I(An2,t))+depth(K[V(St)]/I(St))+1+t+t,depth(S/(L:en))=depth(K[V(An2,t)]/I(An2,t))+1+3t=t1+n(1+t),depth(S/(L,en))=depth(K[V(An1,t)]/I(An1,t))+2t.

    By mathematical induction on n along with the use of Lemma 2.7,

    depth(S/(I(An,t):fn))=(n2)(t+1)+2+2t=n(t+1), (3.9)
    depth(S/(L:en))=(n2)(t+1)t+1+2t=n(1+t), (3.10)
    depth(S/(L,en))=(n2)(t+1)+t+1+2t=n(1+t)+t1. (3.11)

    By applying Lemma 2.2 on Eqs (3.10) and (3.11), we have

    depth(S/(I(An,t),fn))n(1+t). (3.12)

    Since en1L,

    depth(S/(L:en1))K[V(An3)]/I(An3)KK[V(St)]/I(St)KK[en1,en2,1,,en2,t,fn2,1,,fn2,t,en,1,,en,t]. (3.13)

    By induction and applying Lemma 2.7,

    depth(S/(L:en1))=3t+(n3)(t+1)t+t+3=n(t+1). (3.14)

    Now, using Lemma 2.10 on Eq (3.14),

    depth(S/(I(An,t),fn))depth(S/((I(An,t),fn):en1))n(1+t). (3.15)

    From Eqs (3.12)–(3.15), we get

    depth(S/(I(An,t),fn))=n(t+1). (3.16)

    By using the depth lemma on Eqs (3.9) and (3.16),

    depth(S/I(An,t))=n(t+1). (3.17)

    To find the bound for Stanley depth, the proof is similar, and we use Lemma 2.3 instead of Lemma 2.2.

    Corollary 3.8. Let t,n1 and S=K[V(An,t)]. Then,

    pdim(S/I(An,t))={n(1+t),if n is even;n(1+t)+t1,if n is odd.

    Proof. The desired result can be obtained by applying Lemma [14, Theorem 1.3.3] and Lemma 3.7.

    In this section, we prove our main results. We compute the regularity of the cyclic modules, namely K[V(Dn,t)]/I(Dn,t), K[V(En,t)]/I(En,t), and K[V(Fn,t)]/I(Fn,t). Furthermore, we compute a lower bound for the Stanley depth and exact values for depth of K[V(Dn,t)]/I(Dn,t).

    Theorem 4.1. Let n3, t1, and S=K[V(Dn,t)]. Then,

    reg(S/I(Dn,t))={n,if n is even;n1,if n is odd.

    Proof. Let n=3. Then,

    S/(I(D3,t):e3)K[V(A0,t)]/I(A0,t)KK[V(Sq)]/I(Sq)KK[e3,e1,1,,e1,t,e2,1,,e2,t,f1,1,,f1,t,f2,1,,f2,t], (4.1)
    S/((I(D3,t),e3):f3)K[V(A0,t)]/I(A0,t)KK[f3,f1,1,,f1,t,f2,1,,f2,t,e1,1,,e1,t,e2,1,,e2,t,e3,1,,e3,t], (4.2)
    S/((I(D3,t),e3),f3)K[V(A2,t)]/I(A2,t)KK[e3,1,,e3,t,f3,1,,f3,t]. (4.3)

    By applying Lemmas 2.12 and 2.16 on Eqs (4.1)–(4.3), we obtain

    reg(S/(I(D3,t):e3))=reg(K[V(A0,t)]/I(A0,t))+reg(K[V(St)]/I(St)), (4.4)
    reg(S/((I(D3,t),e3):f3))=reg(K[V(A0,t)]/I(A0,t)), (4.5)
    reg(S/((I(D3,t),e3),f3))=reg(K[V(A2,t)]/I(A2,t)). (4.6)

    Applying Lemma 2.7 and Remark 3.1, we have

    reg(S/(I(D3,t):e3))=1,
    reg(S/((I(D3,t),e3):f3))=0,

    and

    reg(S/((I(D3,t),e3),f3))=2.

    Since

    reg(S/((I(D3,t),e3):f3))<reg(S/((I(D3,t),e3),f3)),

    now, using Lemma 2.4(b),

    reg(S/(I(D3,t),e3))=2>reg(S/(I(D3,t):e3)).

    Again, by applying Lemma 2.4(b), reg(S/I(D3,t)=2. If n=4, then

    S/(I(D4,q):e4)K[V(A1,t)]/I(A1,t)KK[V(St)]/I(St)KK[e4,e1,1,,e1,t,e3,1,,e3,t,f1,1,,f1,t,f3,1,,f3,t], (4.7)
    S/((I(D4,t,e4):f4)K[V(A1,t)]/I(A1,t)KK[f4,f1,1,,f1,t,f3,1,,f3,t,e1,1,,e1,t,e3,1,,e3,t,e4,1,,e4,t], (4.8)
    S/((I(D4,t,e4),f4)K[V(A3,t)]/I(A3,t)KK[e4,1,,e4,t]. (4.9)

    By applying Lemma 2.12 on Eqs (4.7)–(4.9),

    reg(S/(I(D4,t):e4))=reg(K[V(A1,t)]/I(A1,t)+reg(K[V(Sq)]/I(Sq)), (4.10)
    reg(S/((I(D4,t,e4):f4))=reg(K[V(A1,t)]/I(A1,t)), (4.11)
    reg(S/((I(D4,t,e4),f4))=reg(K[V(A3,t)]/I(A3,t)), (4.12)

    By applying Remark 3.1 and Lemma 2.7,

    reg(S/(I(D4,t):e4))=3,
    reg(S/((I(D3,t),e4):f4))=2,
    reg(S/((I(D4,t),e4),f4))=4.

    Since

    reg(S/((I(D4,t),e4):f4))<reg(K[V(D4,t)]/((I(D4,t),e4),f4)),

    now, using Lemma 2.4(b),

    reg(S/(I(D4,t),e4))=4>reg(K[V(D4,t)]/(I(D4,t):e4)).

    Again, by applying Lemma 2.4(b), reg(S/I(D4,t)=4. Now we consider two cases.

    Case 1: Let n be even. Then,

    S/((I(Dn,t):en))K[V(An3,t)]/I(An3,t)]KK[V(St)]/I(St)KK[en,e1,1,,e1,t,en1,1,,en1,t,f1,1,,f1,t,fn1,1,,fn1,t], (4.13)
    S/((I(Dn,t),en):fn)K[V(An3,t)]/I(An3,t)KK[fn,f1,1,,f1,t,fn1,1,,fn1,t,e1,1,,e1,t,en1,1,,en1,t,en,1,,en,t], (4.14)
    S/((I(Dn,t),en),fn)K[V(An1,t)]/I(An1,t)]KK[en,1,,en,t,fn1,1,,fn1,t], (4.15)

    by applying Lemmas 2.12 and 2.16 on Eqs (4.13)–(4.15),

    reg(S/(I(Dn,t):en))=reg(K[V(An3,t)]/I(An3,t))+K[V(St)]/I(St), (4.16)
    reg(S/((I(Dn,t),en):fn))=reg(K[V(An3,t)]/I(An3,t)), (4.17)
    reg(S/((I(Dn,t),en),fn))=reg(K[V(An1,t)]/I(An1,t)). (4.18)

    By using induction on n and applying Lemmas 3.4 and 2.7 on Eqs (4.16)–(4.18),

    reg(S/(I(Dn,t):en))=n3+1+1=n1,reg(S/((I(Dn,t),en):fn))=n3+1=n2,reg(S/((I(Dn,t),en),fn))=n1+1=n.

    As, reg(S/((I(Dn,t),en):fn))<reg(S/((I(Dn,t),en),fn)), by applying Lemma 2.4(b),

    reg(S/(I(Rn,t),en))=n.

    Also, reg(S/(I(Dn,t):en))<reg(S/(I(Dn,t),en)), and again by applying Lemma 2.4(b),

    reg(S/I(Dn,t))=n.

    Case 2: When n is odd.

    S/(I(Dn,t):en)K[V(An3,t)]/I(An3,t)KK[V(St)]/I(St)KK[en,e1,1,,e1,t,en1,1,,en1,t,f1,1,,f1,t,fn1,1,,fn1,t], (4.19)
    S/((I(Dn,t),en):fn)K[V(An3,t)]/I(An3,t)KK[fn,f1,1,,f1,t,fn1,1,,fn1,t,e1,1,,e1,t,en1,1,,en1,t,en,1,,en,t], (4.20)
    S/((I(Dn,t),en),fn)K[V(An1,t)]/I(An1,t)]KK[en,1,,en,t,fn1,1,,fn1,t], (4.21)

    By Lemmas 2.12 and 2.16 on Eqs (4.19)–(4.21),

    reg(S/((I(Dn,t):en))=reg(K[V(An3,t)]/I(An3,t))+K[V(St)]/I(St), (4.22)
    reg(S/((I(Dn,t),en):fn))=reg(K[V(An3,t)]/I(An3,t)), (4.23)
    reg(S/((I(Dn,t),en),fn))=reg(K[V(An1,t)]/I(An1,t)). (4.24)

    By applying induction on n along with the use of Lemmas 3.4 and 2.7 on Eqs (4.22)–(4.24),

    reg(S/(I(Dn,t):en))=n3+1=n2,reg(S/((I(Dn,t),en):fn))=n3,reg(S/((I(Dn,t),en),fn))=n1.

    As reg(S/((I(Dn,t),en):fn))<reg(S/((I(Dn,t),en),fn)), by applying Lemma 2.4(b),

    reg(S/(I(Dn,t),en))=n1.

    Also, reg(S/(I(Dn,t):en))<reg(S/(I(Dn,t),en)), so applying Lemma 2.4(b),

    reg(S/I(Dn,t))=n1.

    Lemma 4.2. ([29, Corollary 4.4]). Let G be a graph, and S=K[V(G)]. Then, reg(S/I(Brt(G)))=indmat(Brt(G)).

    Theorem 4.3. Let n3, t1, and S=K[V(En,t)]. Then,

    reg(S/I(En,t))={2n131,if n2(mod3);2n13,if n0,1(mod3);

    Proof. Let n=3. Then, clearly indmat(E3,t)=2, so by using Lemma 4.2 we have

    reg(S/I(E3,t))=2.

    For n4, we have the following isomorphisms:

    S/((I(En,t):en1):fn2)K[V(Bn4,t)]/I(Bn4,t)]KK[en1,fn2,en,1,,en,t,en2,1,,en2,t,fn1,1,,fn1,t,fn,1,,fn,t,fn3,1,,fn3,t], (4.25)
    S/((I(En,t):en1),fn2)K[V(Bn3,t)]/I(Bn3,t)KK[en1,en,1,,en,t,en2,1,,en2,t,fn1,1,,fn1,t,fn2,1,,fn2,t], (4.26)
    S/((I(En,t),en1),fn1)K[V(Bn1,t)]/I(Bn1,t)KK[en1,1,,en1,t,fn1,1,,fn1,t], (4.27)
    S/(((I(En,t),en1):fn1),en)K[V(Bn3,t)]/I(Bn3,t)KK[fn1,en,1,,en,t,fn,1,,fn,t,fn2,1,,fn2,t,en1,1,,en1,t,en2,1,,en2,t], (4.28)
    S/(((I(En,t),en1):fn1):en)K[V(Bn4,t)]/I(Bn4,t)KK[fn1,en1,en1,1,,en1,t,e1,1,,e1,t,f1,1,,f1,t,fn,1,,fn,t,en2,1,,en2,t,fn2,1,,fn2,t]. (4.29)

    Now consider the following cases:

    Case 1: Let n2(mod3).

    We apply Lemmas 2.12 and 3.5 on Eqs (4.25)–(4.29). Since n41(mod3), so

    reg(S/((I(En,t):en1):fn2))=reg(K[V(Bn4,t)]/I(Bn4,t))=2n133.

    We have n32(mod3), so

    reg(S/((I(En,t):en1),fn2))=reg(K[V(Bn3,t)]/I(Bn3,t))=2n132.

    We have n11(mod3), so

    reg(S/((I(En,t),en1),fn1))=reg(K[V(Bn1,t)]/I(Bn1,t))=2n131.

    Since n32(mod3),

    reg(S/(((I(En,t),en1):fn1),en))=reg(K[V(Bn3,t)]/I(Bn3,t))=2n132,

    Also,

    reg(S/(((I(En,t),en1):fn1):en))K[V(Bn4,t)]/I(Bn4,t)=2n133.

    As reg(S/((I(En,t):en1):fn2))<reg(S/((I(En,t):en1),fn2)), so applying Lemma 2.4(b),

    reg(S/(I(En,t):en1))=2n132,

    and reg(S/(((I(En,t),en1):fn1):en))<reg(S/(((I(En,t),en1):fn1),en)). By using Lemma 2.4(b),

    reg(S/((I(En,t),en1):fn1))=2n132.

    Also, reg(S/((I(En,t),en1):fn1))<reg(S/((I(En,t),en1),fn1)). By using Lemma 2.4(b),

    reg(S/(I(En,t),en1))=2n131.

    Also, reg(S/((I(En,t):en1)<reg(S/(I(En,t),en1)). By using Lemma 2.4(b),

    reg(S/(I(En,t))=2n131.

    Case 2: Let n0,1(mod3).

    Applying Lemmas 2.12 and 3.5 on Eqs (4.25)–(4.29), we have

    reg(S/((I(En,t):en1):fn2))=reg(K[V(Bn4,t)]/I(Bn4,t))=2n43,
    reg(S/((I(En,t):en1),fn2))=reg(K[V(Bn3,t)]/I(Bn3,t))=2n33,
    reg(S/((I(En,t),en1),fn1))=reg(K[V(Bn1,t)]/I(Bn1,t))=2n13,
    reg(S/(((I(En,t),en1):fn1),en))=reg(K[V(Bn3,t)]/I(Bn3,t))=2n13,
    reg(S/(((I(En,t),en1):fn1:en))=K[V(Bn1,t)]/I(Bn1,t)=2n43.

    As reg(S/((I(En,t):en1):fn2))<reg(S/((I(En,t):en1),fn2)), applying Lemma 2.4(b),

    reg(S/(I(En,t):en1))=2n43,

    and reg(S/(((I(En,t),en1):fn1):en))<reg(S/(((I(En,t),en1):fn1),en)). By using Lemma 2.4(b)

    reg(S/(I(En,t),en1):fn1))=2n33.

    Since reg(S/((I(En,t),en1):fn1))<reg(S/((I(En,t),en1),fn1)), by using Lemma 2.4(b),

    reg(S/(I(En,t),en1))=2n13.

    Also, reg(S/(I(En,t):en1))<reg(S/(I(En,t),en1)). By using Lemma 2.4(b)

    reg(S/I(En,t))=2n13.

    Theorem 4.4. Let n3, t1, and S=K[V(Fn,t)]. Then,

    reg(S/I(Fn,t))=n12.

    Proof. We have the following isomorphism:

    S/(I(Fn,t):fn)K[V(Cn3,t)]/I(Cn3,t)KK[fn,fn1,1,,fn1,t,f1,1,,f1,t,en,1,,en,t,en1,1,,en1,t,e1,1,,e1,t], (4.30)
    S/((I(Fn,t),fn),en)K[V(Cn1,t)]/I(Cn1,t)KK[fn,1,,fn,t,en,1,,en,t], (4.31)
    S/((I(Fn,t),fn):en)K[V(Cn3,t)]/I(Cn3,t)KK[en,fn,1,,fn,t,en1,1,,en1,t,e1,1,,e1,t]. (4.32)

    Applying Lemmas 3.6 and 2.12 on Eqs (4.30)–(4.32), we have

    reg(S/(I(Fn,t):fn))=reg(K[V(Cn3,t)]/I(Cn3,t))=n32,reg(S/((I(Fn,t),fn),en))=reg(K[V(Cn1,t)]/I(Cn1,t))=n12,reg(S/((I(Fn,t),fn):en))=reg(K[V(Cn3,t)]/I(Cn3,t))=n32.

    Since, reg(S/((I(Fn,t),fn):en))<reg(S/((I(Fn,t),fn),en)), by applying Lemma 2.4(b),

    reg(S/(I(Fn,t),fn))=n12.

    Moreover, reg(S/(I(Fn,t):fn))<reg(S/(I(Fn,t),fn)), and by applying Lemma 2.4(b),

    reg(S/I(Fn,t))=n12.

    Theorem 4.5. Let n3, t1, and S=K[V(Dn,t)]. Then,

    sdepth(S/I(Dn,t))depth(S/I(Dn,t))={n(t+1),if n is odd;n(t+1)+t1,if n is even.

    Proof. Consider the following short exact sequences:

    0S/(I(Dn,t):en)enS/I(Dn,t)S/(I(Dn,t),en)0,

    and

    0S/(L:fn)fnS/LS/(L,fn)0,

    where L:=(I(Dn,t),en). Then, we have the following isomorphisms:

    S/(I(Dn,t):en)K[V(An3,t)]/I(An3,t)KK[V(St)]/I(St)KK[en,en1,1,,en1,t,e1,1,,e1,t,fn1,1,,fn1,t,f1,1,,f1,t] (4.33)
    S/(L:fn)K[V(An3,t)]/I(An3,t)KK[fn,fn1,1,,fn1,t,f1,1,,f1,t,en1,1,,en1,t,e1,1,,e1,t], (4.34)
    S/(L,fn)K[V(An1)]/I(An1)KK[en,1,,en,t,fn,1,,fn,t]. (4.35)

    Case 1: When n is odd. By applying Lemmas 2.6 and 2.12 on Eqs (4.33)–(4.35),

    depth(S/(I(Dn,t):en))=depth(K[V(An3,t)]/I(An3,t))+depth(K[V(St)]/I(St))+1+4t, (4.36)
    depth(S/(L:fn))=depth(K[V(An3,t)]/I(An3,t))+1+5t, (4.37)
    depth(S/(L,fn))=depth(K[V(An1)]/I(An1))+t+t. (4.38)

    Now, by applying Lemmas 2.7 and 3.7 on Eqs (4.36)–(4.38),

    depth(S/(I(Dn,t):en))=t1+n(1+t),depth(S/(L:fn))=n(1+t)+2t2,depth(S/(L,fn))=t1+n(1+t),

    Now, applying Lemma 2.2,

    depth(S/L)t1+n(t+1). (4.39)

    Also, as x1L, and depth(S/(L:x1))=t1+n(1+t). Now, applying Lemma 2.10,

    depth(S/L)t1+n(t+1).

    So,

    depth(S/L)=n(t+1)+t1. (4.40)

    Now, by using the depth lemma, we have

    depth(S/(I(Dn,t))=n(t+1)+t1.

    Case 2: If n is even, then the proof is similar to Case 1.

    The proof for Stanley depth similar we use Lemma 2.3 instead of Lemma 2.2.

    Corollary 4.6. Let t1, n3, and S=K[V(Dn,t)]. Then,

    pdim(S/I(Dn,t))={n(1+t),if n is even;n(1+t)t+1,if n is odd.

    Proof. The desired result can be obtained by applying Theorem 1.4 and [14, Theorem 1.3.3].

    In this paper, we study the algebraic invariants, namely the regularity, projective dimension, depth, and Stanley depth, of the quotient rings of the edge ideals associated to the bristled graphs of various classes of circulant graphs. We give precise values of the said invariants for the quotient rings we considered, except Stanley depth. For the Stanley depth, we give lower bounds that are good enough to verify Stanley's inequality.

    Every author made an equal contribution to this paper. Conceptualization, validation, and review by M. Ishaq, A. Asiri, and A. Hussain; formal analysis, writing original draft, and editing by I. U. Rehman and M. U. K. Afridi.

    The authors declare that they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors thanks the employer of King Abdulaziz University Jeddah Saudi Arabia for their encouragement and financial support.

    The authors declare that there is no conflict of interest in this article.



    [1] B. Alspach, T. D. Parsons, Isomorphism of circulant graphs and digraphs, Discrete Math., 25 (1979), 97–108. https://doi.org/10.1016/0012-365X(79)90011-6 doi: 10.1016/0012-365X(79)90011-6
    [2] F. K. Hwang, A survey on multi-loop networks, Theor. Comput. Sci., 299 (2003), 107–121. https://doi.org/10.1016/S0304-3975(01)00341-3 doi: 10.1016/S0304-3975(01)00341-3
    [3] J. C. Bermond, F. Comellas, D. F. Hsu, Distributed loop computer-networks: A survey, J. Parallel Distr. Com., 24 (1995), 2–10. https://doi.org/10.1006/jpdc.1995.1002 doi: 10.1006/jpdc.1995.1002
    [4] B. Shaukat, M. Ishaq, A. U. Haq, Algebraic invariants of edge ideals of some circulant graphs, AIMS Mathematics, 9 (2023), 868–895. https://doi.org/10.3934/math.2024044 doi: 10.3934/math.2024044
    [5] CoCoATeam, CoCoA: A system for computations in commutative algebra. Available from: http://cocoa.dima.unige.it/.
    [6] D. R. Grayson, M. E. Stillman, Macaulay2: A software system for research in algebraic geometry, 2002. Available from: https://www.unimelb-macaulay2.cloud.edu.au/home.
    [7] R. P. Stanley, Linear Diophantine equations and local cohomology, Invent. Math., 68 (1982), 175–193. https://doi.org/10.1007/BF01394054 doi: 10.1007/BF01394054
    [8] A. M. Duval, B. Goeckner, C. J. Klivans, J. L. Martin, A non-partitionable Cohen–Macaulay simplicial complex, Adv. Math., 299 (2016), 381–395. https://doi.org/10.1016/j.aim.2016.05.011 doi: 10.1016/j.aim.2016.05.011
    [9] J. Herzog, M. Vladoiu, X. Zheng, How to compute the Stanley depth of a monomial ideal, J. Algebra, 322 (2009), 3151–3169. https://doi.org/10.1016/j.jalgebra.2008.01.006 doi: 10.1016/j.jalgebra.2008.01.006
    [10] J. Herzog, A survey on Stanley depth, In: Monomial ideals, computations and applications, Berlin, Heidelberg: Springer, 2013, 3–45. https://doi.org/10.1007/978-3-642-38742-5_1
    [11] M. U. K. Afridi, I. Ur Rehman, M. Ishaq, Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs. Heliyon, 11 (2025), e41783. https://doi.org/10.1016/j.heliyon.2025.e41783 doi: 10.1016/j.heliyon.2025.e41783
    [12] M. M. S. Shahid, M. Ishaq, A. Jirawattanapanit, K. Subkrajang, Depth and Stanley depth of the edge ideals of multi triangular snake and multi triangular ouroboros snake graphs, AIMS Mathematics, 7 (2022), 16449–16463. https://doi.org/10.3934/math.2022900 doi: 10.3934/math.2022900
    [13] Z. Iqbal, M. Ishaq, M. Aamir, Depth and Stanley depth of the edge ideals of square paths and square cycles, Commun. Algebra, 46 (2018), 1188–1198. https://doi.org/10.1080/00927872.2017.1339068 doi: 10.1080/00927872.2017.1339068
    [14] W. Bruns, J. Herzog, Cohen-Macaulay rings, Cambridge university press, 1998. https://doi.org/10.1017/CBO9780511608681
    [15] A. Rauf, Depth and Stanley depth of multigraded modules Commun. Algebra, 38 (2010), 773–784. https://doi.org/10.1080/00927870902829056 doi: 10.1080/00927870902829056
    [16] G. Caviglia, H. T. Hà, J. Herzog, M. Kummini, N. Terai, N. V. Trung, Depth and regularity modulo a principal ideal, J. Algebr. Comb., 49 (2019), 1–20. https://doi.org/10.1007/s10801-018-0811-9 doi: 10.1007/s10801-018-0811-9
    [17] R. H. Villarreal, Monomial algebras, monographs and textbooks in pure and applied mathematics, New York: Marcel Dekker, Inc., 2001.
    [18] A. Alipour, A. Tehranian, Depth and Stanley depth of edge ideals of star graphs, Int. J. Appl. Math. Stat., 56 (2017), 63–69.
    [19] B. Shaukat, M. Ishaq, A. U. Haq, Z. Iqbal, Algebraic properties of edge ideals of corona product of certain graphs, 2022, arXiv: 2211.05721. https://doi.org/10.48550/arXiv.2211.05721
    [20] M. Cimpoeas, Several inequalities regarding Stanley depth, Rom. J. Math. Comput. Sci., 2 (2012), 28–40.
    [21] N. U. Din, M. Ishaq, Z. Sajid, Values and bounds for depth and Stanley depth of some classes of edge ideals, AIMS Mathematics, 6 (2021), 8544–8566. https://doi.org/10.3934/math.2021496 doi: 10.3934/math.2021496
    [22] S. Morey, R. H. Villarreal, Edge ideals: Algebraic and combinatorial properties, Progress in Commut. Algebr., 1 (2012), 85–126.
    [23] G. Kalai, R. Meshulam, Intersections of Leray complexes and regularity of monomial ideals, J. Comb. Theory A, 113 (2006), 1586–1592. https://doi.org/10.1016/j.jcta.2006.01.005 doi: 10.1016/j.jcta.2006.01.005
    [24] J. Herzog, A generalization of the Taylor complex construction, Commun. Algebra, 35 (2007), 1747–1756. https://doi.org/10.1080/00927870601139500 doi: 10.1080/00927870601139500
    [25] M. Katzman, Characteristic-independence of Betti numbers of graph ideals, J. Comb. Theory A, 113 (2006), 435–454. https://doi.org/10.1016/j.jcta.2005.04.005 doi: 10.1016/j.jcta.2005.04.005
    [26] H. T. Hà, A. V. Tuyl, Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers, J. Algebr. Comb., 27 (2008), 215–245. https://doi.org/10.1007/s10801-007-0079-y doi: 10.1007/s10801-007-0079-y
    [27] R. Woodroofe, Matchings, coverings, and Castelnuovo-Mumford regularity, J. Commut. Algebra, 6 (2014), 287–304.
    [28] L. T. Hoa, N. D. Tam, On some invariants of a mixed product of ideals, Arch. Math., 94 (2010), 327–337. https://doi.org/10.1007/s00013-010-0112-6 doi: 10.1007/s00013-010-0112-6
    [29] Y. Muta, M. R. Pournaki, N. Terai, A local cohomological viewpoint on edge rings associated with multi-whisker graphs, Commun. Algebra, 53 (2024), 1856–1865. https://doi.org/10.1080/00927872.2024.2423888 doi: 10.1080/00927872.2024.2423888
  • Reader Comments
  • © 2025 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(262) PDF downloads(37) Cited by(0)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog