Results 31 to 40 of about 1,194,320 (236)
d-Sequence edge binomials, and regularity of powers of binomial edge ideals of trees
Journal of Algebra and Its Applications, 2023 In this paper, we provide the necessary and sufficient conditions for the edge binomials of the tree forming a [Formula: see text]-sequence in terms of the degree sequence notion of a graph. We study the regularity of powers of the binomial edge ideals of trees generated by [Formula: see text]-sequence edge binomials.
Marie Amalore Nambi, Neeraj Kumar
openaire +4 more sources
Waldschmidt constant of some classes of hypergraphs [PDF]
AUT Journal of Mathematics and ComputingIn this paper, we present a formula for the Waldschmidt constant of edge ideals of some classes of hypergraphs. We also show that if $G$ is a simple graph with binomial edge ideal $J_G$, then the Waldschmidt constant of $J_G$ is always 2.
Iman Jahani, Shamila Bayati
doaj +1 more source
Binomial Edge Ideals with Quadratic Gröbner Bases [PDF]
The Electronic Journal of Combinatorics, 2011 We prove that a binomial edge ideal of a graph $G$ has a quadratic Gröbner basis with respect to some term order if and only if the graph $G$ is closed with respect to a given labelling of the vertices. We also state some criteria for the closedness of a graph $G$ that do not depend on the labelling of its vertex set.
CRUPI, Marilena, RINALDO, GIANCARLO
openaire +4 more sources
Graph connectivity and binomial edge ideals
Proceedings of the American Mathematical Society, 2016 We relate homological properties of a binomial edge ideal $\mathcal{J}_G$ to invariants that measure the connectivity of a simple graph $G$. Specifically, we show if $R/\mathcal{J}_G$ is a Cohen-Macaulay ring, then graph toughness of $G$ is exactly $\frac{1}{2}$.
Banerjee, Arindam +1 more
openaire +3 more sources
Extremal Betti Numbers of Some Cohen-Macaulay Binomial Edge Ideals
, 2021 We provide the regularity and the Cohen-Macaulay type of binomial edge ideals of Cohen-Macaulay cones, and we show the extremal Betti numbers of some classes of Cohen-Macaulay binomial edge ideals: Cohen-Macaulay bipartite and fan graphs. In addition, we
Rinaldo, G, Mascia, C
core +1 more source
POWERS OF BINOMIAL EDGE IDEALS WITH QUADRATIC GRÖBNER BASES [PDF]
Nagoya Mathematical Journal, 2021 AbstractWe study powers of binomial edge ideals associated with closed and block graphs.
VIVIANA ENE +2 more
openaire +5 more sources
Construction of Cohen–Macaulay Binomial Edge Ideals [PDF]
Communications in Algebra, 2013 We discuss algebraic and homological properties of binomial edge ideals associated to graphs which are obtained by gluing of subgraphs and the formation of cones.
Rauf A., RINALDO, GIANCARLO
openaire +3 more sources
Binomial edge ideals of generalized block graphs [PDF]
International Journal of Algebra and Computation, 2020 We classify generalized block graphs whose binomial edge ideals admit a unique extremal Betti number. We prove that the Castelnuovo–Mumford regularity of binomial edge ideals of generalized block graphs is bounded below by [Formula: see text], where [Formula: see text] is the number of minimal cut sets of the graph [Formula: see text] and obtain an ...
openaire +2 more sources
Modulation of miR‐23b Wnt/β‐catenin Axis Strengthens Endothelial Barrier Properties
Advanced Science, EarlyView.Early blood‐brain barrier (BBB) disruption contributes to stroke and CNS disease pathology. miR‐23b was identified as a regulator of BBB integrity in brain endothelial cells. Inhibition of miR‐23b enhanced barrier‐associated properties, promoted repair‐related signaling, and reduced BBB leakage in experimental stroke models, supporting further ...
Victor Anthony Martinez +16 more
wiley +1 more source
Generalized binomial edge ideals of bipartite graphs
, 2023 Connected bipartite graphs whose binomial edge ideals are Cohen--Macaulay have been classified by Bolognini et al. In this paper, we compute the depth, Castelnuovo--Mumford regularity, and dimension of the generalized binomial edge ideals of these ...
Shen, Yi-Huang, Zhu, Guangjun
core