Results 11 to 20 of about 1,118,707 (279)
Le Matematiche, 2012 We compute the Betti numbers for all the powers of initial and final lexsegment edge ideals. For the powers of the edge ideal of an anti–d−path, we prove that they have linear quotients and we characterize the normally torsion–free ideals. We determine a
Carmela Ferrò +2 more
doaj +6 more sources
Generalized binomial edge ideals [PDF]
Advances in Applied Mathematics, 2013 6 pages.
Rauh, Johannes, Johannes Rauh
openaire +3 more sources
Binomial edge ideals of bipartite graphs [PDF]
European Journal of Combinatorics, 2018 We classify the bipartite graphs $G$ whose binomial edge ideal $J_G$ is Cohen-Macaulay. The connected components of such graphs can be obtained by gluing a finite number of basic blocks with two operations. In this context we prove the converse of a well-known result due to Hartshorne, showing that the Cohen-Macaulayness of these ideals is equivalent ...
Davide Bolognini +2 more
core +7 more sources
On the Arithmetical Rank of the Edge Ideals of Forests [PDF]
Communications in Algebra, 2008 We show that for the edge ideals of a certain class of forests, the arithmetical rank equals the projective dimension.
Margherita Barile
exaly +4 more sources
Computing degree based topological indices of algebraic hypergraphs [PDF]
HeliyonTopological indices are numerical parameters that indicate the topology of graphs or hypergraphs. A hypergraph H=(V(H),E(H)) consists of a vertex set V(H) and an edge set E(H), where each edge e∈E(H) is a subset of V(H) with at least two elements.
Amal S. Alali +4 more
doaj +2 more sources
Binomial Edge Ideals of Graphs [PDF]
The Electronic Journal of Combinatorics, 2012 We characterize all graphs whose binomial edge ideals have a linear resolution. Indeed, we show that complete graphs are the only graphs with this property. We also compute some graded components of the first Betti number of the binomial edge ideal of a graph with respect to the graphical terms.
Dariush Kiani, Sara Saeedi Madani
openaire +3 more sources
EDGE IDEALS OF WEIGHTED GRAPHS [PDF]
Journal of Algebra and Its Applications, 2013 We study weighted graphs and their "edge ideals" which are ideals in polynomial rings that are defined in terms of the graphs. We provide combinatorial descriptions of m-irreducible decompositions for the edge ideal of a weighted graph in terms of the combinatorics of "weighted vertex covers". We use these, for instance, to say when these ideals are m-
Paulsen, Chelsey, Sather-Wagstaff, Sean
openaire +3 more sources
Generators of maximal left ideals in Banach algebras [PDF]
, 2012 In 1971, Grauert and Remmert proved that a commutative, complex, Noetherian Banach algebra is necessarily finite-dimensional. More precisely, they proved that a commutative, complex Banach algebra has finite dimension over C whenever all the closed ...
Dales, H.G., Zelazko, W.
core +4 more sources
Stanley Depth of the Edge Ideal of Extended Gear Networks and Application in Circuit Analysis
Journal of Mathematics, 2022 Graph theory is widely used in power network analysis, complex network, and engineering calculation. Stanley depth is a geometric invariant of the module which is closely related to an algebraic invariant called depth of the module.
Guiling Zeng +4 more
doaj +1 more source
The regularity of binomial edge ideals of graphs [PDF]
AUT Journal of Mathematics and Computing, 2020 In this paper, we study the Castelnuovo-Mumford regularity and the graded Betti numbers of the binomial edge ideals of some classes of graphs. Our special attention is devoted to a conjecture which asserts that the number of maximal cliques of a graph ...
Sara Saeedi Madani, Dariush Kiani
doaj +1 more source