42 citations · 120 across the 18 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017★ 8 cited
Is there any polynomial upper bound for the universal labeling of graphs?
Arash Ahadi, Ali Dehghan, Morteza Saghafian
A {\it universal labeling} of a graph is a labeling of the edge set in such that in every orientation of for every two adjacent vertices and , the sum of…
cs.DM2017★ 42 cited
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…
math.CO2017
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…