Results 31 to 40 of about 213,086 (270)

An algorithm for generating generalized splines on graphs such as complete graphs, complete bipartite graphs and hypercubes

open access: yesAKCE 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

Ecology of Flora and Fauna in Kerman Ceramics from the 11th to the 13th Centuries AH [PDF]

open access: yesنگره, 2022
Kerman was one of the most important pottery production bases in Iran in the Safavid era during the 11 to the 13 centuries AH (16 to 18 AD) and the products of its workshops have been exported to European markets in addition to domestic consumption. Iran
hamidreza rohani   +2 more
doaj   +1 more source

Blow-up algebras, determinantal ideals, and Dedekind-Mertens-like formulas [PDF]

open access: yes, 2016
We investigate Rees algebras and special fiber rings obtained by blowing up specialized Ferrers ideals. This class of monomial ideals includes strongly stable monomial ideals generated in degree two and edge ideals of prominent classes of graphs.
Corso, Alberto   +3 more
core   +3 more sources

The clique number of the intersection graph of a cyclic group of order with at most three prime factors [PDF]

open access: yesریاضی و جامعه, 2023
Let $G$ be a finite non-trivial group. The intersection graph $\Gamma(G)$, is a graph whose vertices are all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H $ and $K$ if and only if $H\cap K\neq 1$.
Seyyed Majid Jafarian Amiri   +1 more
doaj   +1 more source

Binomial edge ideals of unicyclic graphs [PDF]

open access: yesInternational 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

The Regularity of Some Families of Circulant Graphs

open access: yesMathematics, 2019
We compute the Castelnuovo−Mumford regularity of the edge ideals of two families of circulant graphs, which includes all cubic circulant graphs.
Miguel Eduardo Uribe-Paczka   +1 more
doaj   +1 more source

Hilbert series of binomial edge ideals [PDF]

open access: yesCommunications in Algebra, 2019
13 pages, 2 images, typo error corrected, Accepted in Comm ...
Arvind Kumar, Rajib Sarkar
openaire   +2 more sources

Regularity of second power of edge ideals

open access: yesپژوهش‌های ریاضی, 2022
Introduction ‎‎ The study of the minimal free resolution of homogenous ideals and their powers is an interesting and active area of research in commutative algebra.
Seyed Amin Seyed Fakhari
doaj  

The v-number of edge ideals

open access: yesJournal 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

Koszul binomial edge ideals

open access: yesForum of Mathematics, Sigma
The study of Koszul binomial edge ideals was initiated by V. Ene, J. Herzog, and T. Hibi in 2014, who found necessary conditions for Koszulness. The binomial edge ideal $J_G$ associated to a finite simple graph G is always generated by quadrics ...
Adam LaClair   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy