Results 31 to 40 of about 1,161,259 (282)

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

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

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

Software-Defined Heterogeneous Edge Computing Network Resource Scheduling Based on Reinforcement Learning

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

The v-number of edge ideals

Journal of Combinatorial Theory, Series A, 2021
The aim of this work is to study the v-number of edge ideals of clutters and graphs. We relate the v-number with the regularity of edge ideals and study the combinatorial structure of the graphs whose edge ideals have their second symbolic power Cohen-Macaulay.
Jaramillo, Delio, Villarreal, Rafael H.
openaire   +2 more sources

A Lower Bound For Depths of Powers of Edge Ideals [PDF]

, 2015
Let $G$ be a graph and let $I$ be the edge ideal of $G$. Our main results in this article provide lower bounds for the depth of the first three powers of $I$ in terms of the diameter of $G$.
Fouli, Louiza, Morey, Susan
core   +1 more source

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

A NOTE ON MATCHINGS AND REGULARITY OF GRAPHS

Tạp chí Khoa học
Let 𝐺 be a simple graph. We introduce the notion of comb- match(𝐺), and prove that reg(𝐼(𝐺)) ≤ comb-match(𝐺)+1.
Dao Thi Thanh Ha
doaj   +1 more source

Nonlinear gyrofluid computation of edge localised ideal ballooning modes

, 2010
Three dimensional electromagnetic gyrofluid simulations of the ideal ballooning mode blowout scenario for tokamak edge localized modes (ELMs) are presented.
Kendl, A., Ribeiro, T., Scott, B. D.
core   +1 more source

Generalized binomial edge ideals

Advances in Applied Mathematics, 2013
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr bner basis can be computed by studying paths in the graph.
openaire   +2 more sources