Results 21 to 30 of about 138,912 (199)
Stanley Depth of Edge Ideals of Some Wheel-Related Graphs
Mathematics, 2019 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
Matchings and squarefree powers of edge ideals [PDF]
Journal of Combinatorial Theory, Series A, 2022 21 pages, 6 ...
Erey, Nursel +3 more
openaire +6 more sources
Cohen-Macaulay and (S2) Properties of the Second Power of Squarefree Monomial Ideals
Mathematics, 2019 We show that Cohen-Macaulay and (S 2 ) properties are equivalent for the second power of an edge ideal. We give an example of a Gorenstein squarefree monomial ideal I such that S / I 2 satisfies the Serre condition (S 2 ), but is ...
Do Trong Hoang +2 more
doaj +1 more source
Algebraic Algorithms for Even Circuits in Graphs
Mathematics, 2019 We present an algebraic algorithm to detect the existence of and to list all indecomposable even circuits in a given graph. We also discuss an application of our work to the study of directed cycles in digraphs.
Huy Tài Hà, Susan Morey
doaj +1 more source
Parity binomial edge ideals [PDF]
Journal of Algebraic Combinatorics, 2015 21 pages, 3 figures, v2: minor problem in proof of Lemma 2.4 corrected, construction of Gr\"obner basis in Section 3 corrected, Example 5.1 replaced by Remark 5.1, final version as in Journal of Algebraic Combinatorics, v3: footnote to Lemma 3.8 ...
Kahle, Thomas +2 more
openaire +2 more sources
Applied Sciences, 2022 With the rapid development of wireless networks, wireless edge computing networks have been widely considered. The heterogeneous characteristics of the 6G edge computing network bring new challenges to network resource scheduling.
Yaofang Li, Bin Wu
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 +2 more sources
Center Body Airfoil Design for Blended Wing Body Configuration [PDF]
Xibei Gongye Daxue Xuebao, 2018 To design the center-body airfoil of a blended wing body configuration, the aerodynamic effects of the symmetrical airfoil, trailing-edge reflexed airfoil, leading-edge loaded airfoil and leading-edge loaded plus trailing-edge reflexed airfoil are ...
doaj +1 more source
Hilbert series of binomial edge ideals [PDF]
Communications in Algebra, 2019 13 pages, 2 images, typo error corrected, Accepted in Comm ...
Arvind Kumar, Rajib Sarkar
openaire +2 more sources
DEPTH AND STANLEY DEPTH OF THE EDGE IDEALS OF SOME m-LINE GRAPHS AND m-CYCLIC GRAPHS WITH A COMMON VERTEX [PDF]
Romanian Journal of Mathematics and Computer Science, 2015 We give some precise formulas for the depth of the quotient rings of the edge ideals associated to a graph consisting, either of the union of some line graphs L_{3r_1}},...,L_{3r_{k_1}}, L_{3s_1+1}, ...,L_{3s_{k_2}+1} and L_{3t_1+2},...,L_{3t_{k_3}+2} or
GUANGJUN ZHU
doaj