in this paper we define ( , ) k  q -fuzzy h -sub hemirings, ( , ) k  q -fuzzy h -ideals, ( , ) k  q - fuzzy     h -bi-ideals and ( , ) k  q -fuzzy h -quasi-ideals. we characterize h -hemiregular and h -intrahemiregular hemirings by the properties of their     ( , ) k  q -fuzzy h -ideals, ( , ) k  q -fuzzy h -bi-ideals and     ( , ) k  q -fuzzy h -quasi-...

Let $\operatorname{pd}(I(G))$ and $\operatorname{reg}(I(G))$ respectively denote the projective dimension regularity of edge ideal $I(G)$ a graph $G$. For any positive integer $n$, we determine all pairs $(\operatorname{pd}(I(G)),\, \operatorname{reg}(I(G)))$ as $G$ ranges over connected bipartite graphs on $n$ vertices.

Finite obstruction sets for lower ideals in the minor order are guaranteed to exist by the Graph Minor Theorem. It has been known for several years that, in principle, obstruction sets can be mechanically computed for most natural lower ideals. In this paper, we describe a general-purpose method for nding obstructions by using a bounded treewidth (or pathwidth) search. We illustrate this approa...

Let G be a finite simple graph and I(G) denote the corresponding edge ideal. In this paper, we obtain upper bounds for Castelnuovo-Mumford regularity of I(G)q in terms certain combinatorial invariants associated with G. We also prove weaker version conjecture by Alilooee, Banerjee, Beyarslan Hà on an bound conjectured class vertex decomposable graphs. Using these results, explicitly compute sev...

In this paper we introduce the concept of clique disjoint edge sets in graphs. Then, for a graph G, define invariant ?(G) as maximum size set G. We show that regularity binomial ideal G is bounded above by ?(G). This, particular, settles conjecture on ideals full generality.