Arash Ahadi

most citedAlgorithmic complexity of proper labeling problems

42 citations · 44 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2017

Algorithmic Complexity of Weakly Semiregular Partitioning and the Representation Number

Arash Ahadi, Ali Dehghan, Mohsen Mollahajiaghaei

A graph $G$ is {\it weakly semiregular} if there are two numbers $a, b$ , such that the degree of every vertex is $a$ or $b$ . The {\it weakly semiregular number} of a graph $G$ , deno…

math.CO2010★ 2 cited

On the Lucky labeling of Graphs

Arash Ahadi, Ali Dehghan, Esmael Mollaahmadi

Suppose the vertices of a graph $G$ were labeled arbitrarily by positive integers, and let $S u m (v)$ denote the sum of labels over all neighbors of vertex $v$ . A labeling is lucky i…