1 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2023
Edge-Locating Coloring of Graphs
M. Korivand, D. A. Mojdeh, Edy Tri Baskoro +1
An edge-locating coloring of a simple connected graph is a partition of its edge set into matchings such that the vertices of are distinguished by the distance to the match…
math.CO2017★ 1 cited
On the packing numbers in graphs
D. A. Mojdeh, B. Samadi, A. Khodkar +1
In this paper, we find upper bounds on the open packing and -limited packing numbers with emphasis on the cases and . We solve the problem of characterizing all conne…
math.CO2016★ 1 cited
On the inverse signed total domination number in graphs
D. A. Mojdeh, Babak Samadi
In this paper, we study the inverse signed total domination number in graphs and present new lower and upper bounds on this parameter. For example by making use of the classic theo…