Somayeh Moradi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Somayeh Moradi has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Jürgen Herzog
Fachbereich Mathematik, Universität Duisburg-Essen, Essen, Germany
15 shared publications - Antonino Ficarra
Universidade de Évora
12 shared publications Jürgen Herzog
Universität Duisburg-Essen
6 shared publicationsMasoomeh Rahimbeigi
Universität Duisburg-Essen
5 shared publications- Masoomeh Rahimbeigi3 shared publications
- Oleksandra Gasanova
Faculty of Mathematics, University of Duisburg-Essen, Essen, Germany
3 shared publications
Latest Publications
- 23 October 2026
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
Dominated chromatic number of central graphs
Let [Formula: see text] be a graph with no isolated vertex. A dominated coloring of [Formula: see text] is a proper coloring of [Formula: see text] such that each color class is dominated by at least one vertex. The minimum number of colors needed for a dominated coloring of [Formula: see text] is called the dominated chromatic number of [Formula: see text], denoted by [Formula: see text]. In this paper, we study the dominated chromatic number of central graphs. We obtain some tight bounds for the dominated chromatic number of a central graph [Formula: see text] in terms of some invariants of the graph [Formula: see text]. Also we characterize the dominated chromatic number of the central graph of some families of graphs such as star graphs, path graphs, spider graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs and friendship graphs, explicitly. Moreover, some Nordhaus–Gaddum-like relations are presented for the dominated chromatic number of central graphs.
- 23 October 2026
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
Dominated chromatic number of central graphs
Let [Formula: see text] be a graph with no isolated vertex. A dominated coloring of [Formula: see text] is a proper coloring of [Formula: see text] such that each color class is dominated by at least one vertex. The minimum number of colors needed for a dominated coloring of [Formula: see text] is called the dominated chromatic number of [Formula: see text], denoted by [Formula: see text]. In this paper, we study the dominated chromatic number of central graphs. We obtain some tight bounds for the dominated chromatic number of a central graph [Formula: see text] in terms of some invariants of the graph [Formula: see text]. Also we characterize the dominated chromatic number of the central graph of some families of graphs such as star graphs, path graphs, spider graphs, cycle graphs, wheel graphs, complete graphs, complete bipartite graphs and friendship graphs, explicitly. Moreover, some Nordhaus–Gaddum-like relations are presented for the dominated chromatic number of central graphs.
- 15 October 2026
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- p. 1-19
Monomial ideals whose all matching powers are Cohen–Macaulay
In the present article, we aim to classify monomial ideals whose all matching powers are Cohen–Macaulay. We especially focus our attention on edge ideals. The Cohen–Macaulayness of the last matching power of an edge ideal is characterized, providing an algebraic analog of the famous Tutte theorem regarding graphs having a perfect matching. For chordal graphs, very well-covered graphs, and Cameron–Walker graphs, we completely solve our problem.
- 15 October 2026
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- p. 1-19
Monomial ideals whose all matching powers are Cohen–Macaulay
In the present article, we aim to classify monomial ideals whose all matching powers are Cohen–Macaulay. We especially focus our attention on edge ideals. The Cohen–Macaulayness of the last matching power of an edge ideal is characterized, providing an algebraic analog of the famous Tutte theorem regarding graphs having a perfect matching. For chordal graphs, very well-covered graphs, and Cameron–Walker graphs, we completely solve our problem.
- 30 July 2026
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 49 (4) , 153
Rees Algebras of Complementary Edge Ideals
- 30 July 2026
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 49 (4) , 153
Rees Algebras of Complementary Edge Ideals
- 22 February 2026
- Published by Springer Nature
- p. 85-124
Cohen-Macaulay Modules and the Canonical Module
- 22 February 2026
- Published by Springer Nature
- p. 85-124
Cohen-Macaulay Modules and the Canonical Module
- 22 February 2026
- Published by Springer Nature
- p. 1-48
Basic Commutative Algebra
- 22 February 2026
- Published by Springer Nature
- p. 49-84
Homological Methods (on Graded Structures)
- 22 February 2026
- Published by Springer Nature
- p. 169-188
Almost Symmetric and Nearly Symmetric Numerical Semigroups
- 22 February 2026
- Published by Springer Nature
- p. 169-188
Almost Symmetric and Nearly Symmetric Numerical Semigroups
- Open Access
On homological invariants and Cohen-Macaulayness of closed neighborhood ideals
Let $G$ be a finite simple graph and $NI(G)$ be the closed neighborhood ideal of $G$ in the polynomial ring $S=K[V(G)]$. In this paper, we study the Castelnuovo-Mumford regularity, projective dimension and Cohen-Macaulayness of this ideal. For any chordal graph $G$, we show that $\text{reg}(S/NI(G))=τ(G)$, where $τ(G)$ denotes the vertex cover number of $G$. This generalizes the corresponding result for trees shown in [3], as in trees $τ(G)$ is the same as the matching number of $G$. When $G$ is a bipartite graph or a very well-covered graph, we notice that $\text{reg}(S/NI(G))\geq τ(G)$ and that this inequality can be strict in general. Moreover, we describe the projective dimension of $S/NI(G)$ for some families of graphs. Finally, we give a characterization of very well-covered graphs $G$ for which the ring $S/NI(G)$ is Cohen-Macaulay.Open AccessOn homological invariants and Cohen-Macaulayness of closed neighborhood ideals
Let $G$ be a finite simple graph and $NI(G)$ be the closed neighborhood ideal of $G$ in the polynomial ring $S=K[V(G)]$. In this paper, we study the Castelnuovo-Mumford regularity, projective dimension and Cohen-Macaulayness of this ideal. For any chordal graph $G$, we show that $\text{reg}(S/NI(G))=τ(G)$, where $τ(G)$ denotes the vertex cover number of $G$. This generalizes the corresponding result for trees shown in [3], as in trees $τ(G)$ is the same as the matching number of $G$. When $G$ is a bipartite graph or a very well-covered graph, we notice that $\text{reg}(S/NI(G))\geq τ(G)$ and that this inequality can be strict in general. Moreover, we describe the projective dimension of $S/NI(G)$ for some families of graphs. Finally, we give a characterization of very well-covered graphs $G$ for which the ring $S/NI(G)$ is Cohen-Macaulay. - 7 December 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 62 (4) , 56
Componentwise linear symbolic powers of edge ideals and Minh’s conjecture
- 7 December 2025
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 62 (4) , 56
Componentwise linear symbolic powers of edge ideals and Minh’s conjecture
- 30 September 2025
- Published by Springer Nature in Collectanea Mathematica
- Vol. 77 (3) , 1-15
Toric rings attached to simplicial complexes
- 30 September 2025
- Published by Springer Nature in Collectanea Mathematica
- Vol. 77 (3) , 1-15
Toric rings attached to simplicial complexes