42 citations · 44 across the 4 of their papers we have counts for
4 papers
Algorithmic complexity of proper labeling problems
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex co…
Algorithmic Complexity of Weakly Semiregular Partitioning and the Representation Number
Arash Ahadi, Ali Dehghan, Mohsen Mollahajiaghaei
A graph is {\it weakly semiregular} if there are two numbers , such that the degree of every vertex is or . The {\it weakly semiregular number} of a graph , deno…
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
Ali Dehghan, Mohsen Mollahajiaghaei
An assignment of numbers to the vertices of graph G is closed distinguishing if for any two adjacent vertices v and u the sum of labels of the vertices in the closed neighborhood o…
On the Lucky labeling of Graphs
Arash Ahadi, Ali Dehghan, Esmael Mollaahmadi
Suppose the vertices of a graph were labeled arbitrarily by positive integers, and let denote the sum of labels over all neighbors of vertex . A labeling is lucky i…