10 citations · 17 across the 4 of their papers we have counts for
5 papers
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…
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…
Classes of normally and nearly normally torsion-free monomial ideals
Mehrdad Nasernejad, Ayesha Asloob Qureshi, Kazem Khashyarmanesh +1
In this paper, our main focus is to explore different classes of nearly normally torsion-free ideals. We first characterize all finite simple connected graphs with nearly normally…
On the matroidal path ideals
Mehrdad Nasernejad, Kazem Khashyarmanesh, Ayesha Asloob Qureshi
We prove that the set of all paths of a fixed length in a complete multipartite graph is the bases of a matroid. Moreover, we discuss the Cohen-Macaulayness and depth of powers of…
Counting short cycles of (c,d)-regular bipartite graphs
Mohsen Alinejad, Kazem Khashyarmanesh
Recently, working on the Tanner graph which represents a low density parity check (LDPC) code becomes an interesting research subject. Finding the number of short cycles of Tanner…