4 citations · 4 across the 2 of their papers we have counts for
2 papers
math.CO2023
Uniquely Distinguishing Colorable Graphs
M. Korivand, N. Soltankhah, K. Khashyarmanesh
A graph is called uniquely distinguishing colorable if there is only one partition of vertices of the graph that forms distinguishing coloring with the smallest possible colors. In…
math.AC2021★ 4 cited
Results on the normality of square-free monomial ideals and cover ideals under some graph operations
Ibrahim Al-Ayyoub, Mehrdad Nasernejad, Kazem Khashyarmanesh +2
In this paper, we introduce techniques for producing normal square-free monomial ideals from old such ideals. These techniques are then used to investigate the normality of cover i…