Results 31 to 40 of about 1,118,707 (279)
Depth and Stanley Depth of the Edge Ideals of r-Fold Bristled Graphs of Some Graphs
Mathematics, 2023 In this paper, we find values of depth, Stanley depth, and projective dimension of the quotient rings of the edge ideals associated with r-fold bristled graphs of ladder graphs, circular ladder graphs, some king’s graphs, and circular king’s graphs.
Ying Wang +5 more
doaj +1 more source
Binomial edge ideals of unicyclic graphs [PDF]
International Journal of Algebra and Computation, 2021 Let [Formula: see text] be a connected graph on the vertex set [Formula: see text]. Then [Formula: see text]. In this paper, we prove that if [Formula: see text] is a unicyclic graph, then the depth of [Formula: see text] is bounded below by [Formula: see text]. Also, we characterize [Formula: see text] with [Formula: see text] and [Formula: see text].
openaire +3 more sources
On the binomial edge ideals of block graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity.
Chaudhry Faryal +2 more
doaj +1 more source
Ideal based hypergraph of a commutative ring
AKCE International Journal of Graphs and Combinatorics, 2021 Let R be a commutative ring and k an integer strictly greater than 2. The k-maximal ideal hypergraph to R with vertex set the set of all k-maximal ideals in R and for distinct ideals I1, in the set is an edge of if and only if and the sum of any elements
V. C. Amritha, K. Selvakumar
doaj +1 more source
Regularity and $h$-Polynomials of Edge Ideals [PDF]
The Electronic Journal of Combinatorics, 2019 For any two integers $d,r \geqslant 1$, we show that there exists an edge ideal $I(G)$ such that ${\rm reg}\left(R/I(G)\right)$, the Castelnuovo-Mumford regularity of $R/I(G)$, is $r$, and $\deg h_{R/I(G)}(t)$, the degree of the $h$-polynomial of $R/I(G)$, is $d$.
Takayuki Hibi +2 more
openaire +3 more sources
On the hilbert series of binomial edge ideals of generalized trees [PDF]
Transactions on Combinatorics, 2017 In this paper we introduce the concept of generalized trees and compute the Hilbert series of their binomial edge ideals.
Mahdis Saeedi, Farhad Rahmati
doaj +1 more source
Religious Dimensions in Transhumanist and Posthumanist Philosophies of Science
Conatus - Journal of Philosophy, 2021 The article discusses transhumanism and posthumanism as marginal trajectories of the modern philosophy of science, which, however, distinctly influence the mainstream narrative of science and societal relations.
Evaldas Juozelis
doaj +1 more source
On The Binomial Edge Ideal of a Pair of Graphs [PDF]
The Electronic Journal of Combinatorics, 2013 We characterize all pairs of graphs $(G_1,G_2)$, for which the binomial edge ideal $J_{G_1,G_2}$ has linear relations. We show that $J_{G_1,G_2}$ has a linear resolution if and only if $G_1$ and $G_2$ are complete and one of them is just an edge. We also compute some of the graded Betti numbers of the binomial edge ideal of a pair of graphs with ...
Sara Saeedi Madani, Dariush Kiani
openaire +3 more sources
AKCE International Journal of Graphs and Combinatorics, 2020 An edge labeled graph is a graph whose edges are labeled with non-zero ideals of a commutative ring . A Generalized Spline on an edge labeled graph is a vertex labeling of by elements of the ring , such that the difference between any two adjacent vertex
Radha Madhavi Duggaraju, Lipika Mazumdar
doaj +1 more source
The reconstruction conjecture and edge ideals
Discrete Mathematics, 2008 In this paper the authors take a new look at the Reconstruction Problem by trying to reconstruct from the deck of vertex-deleted subgraphs of \(G\) several algebraic properties of the edge ideal of \(G\), which is the ideal \(I(G)\) of the polynomial ring \(R=k[x_1,x_2,\ldots,x_n]\), generated by the square-free monomials \(x_ix_j\) where \(\{x_i,x_j\}\
Kia Dalili, Sara Faridi, Will Traves
openaire +1 more source