Results 21 to 30 of about 1,905,501 (295)
Breakdown capability of ${\beta }$ -Ga2O3/GaN heterojunction-based vertical p-n power diodes with mesa edge termination (ET) was comprehensively investigated using TCAD simulation.
Dinusha Herath Mudiyanselage +2 more
doaj +1 more source
Resource Allocation Strategy Based on Game Theory in Mobile Edge Computing [PDF]
The existing research on resource allocation strategies of mobile edge computing mostly focus on delay and energy consumption,but relatively less consideration is given to the benefits of edge servers.When considering the benefits of edge servers,many ...
CHEN Yipeng, YANG Zhe, GU Fei, ZHAO Lei
doaj +1 more source
Koszul Binomial Edge Ideals [PDF]
It is shown that if the binomial edge ideal of a graph $G$ defines a Koszul algebra, then $G$ must be chordal and claw free. A converse of this statement is proved for a class of chordal and claw free graphs.
Ene, Viviana +2 more
openaire +2 more sources
On the Stanley Depth of Powers of Monomial Ideals
In 1982, Stanley predicted a combinatorial upper bound for the depth of any finitely generated multigraded module over a polynomial ring. The predicted invariant is now called the Stanley depth. Duval et al.
S. A. Seyed Fakhari
doaj +1 more source
Binomial edge ideals of unicyclic graphs [PDF]
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
Who is the originator of Immediate Edge App?
In the first place, if the broker wishes to utilize the Immediate Edge App exchanging stage, he/she needs to get enrolled on the stage. The confirmation framework is extremely simple and fast.
Immediate Edge App
core +1 more source
Monomial s-sequences arising from graph ideals
Ideals arising from graphs are investigated via s-sequence theory. In particular, the notion of s-sequence for the generators of the edge ideal I(G) of an acyclic graph G is considered for describing the Groebner basis of the relation ideal J of the ...
Maurizio Imbesi, Monica La Barbiera
doaj +1 more source
In the digital economy era, cloud–edge collaboration technology provides the necessary technical support for the digital transformation of enterprises, which can improve the quality of services (QoS), and it attracts extensive attention from scholars and
Shiyong Li, Min Xu, Huan Liu, Wei Sun
doaj +1 more source
Stanley Depth of Edge Ideals of Some Wheel-Related Graphs
Stanley depth is a geometric invariant of the module and is related to an algebraic invariant called depth of the module. We compute Stanley depth of the quotient of edge ideals associated with some familiar families of wheel-related graphs.
Jia-Bao Liu +4 more
doaj +1 more source
Regularity and $h$-Polynomials of Edge Ideals [PDF]
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

