A. Ahadi

activity

20092026

most citedAlgorithmic complexity of proper labeling problems

42 citations · 120 across the 18 of their papers we have counts for

collaborators

Showing 2013Show all

2 papers · 1 filter

math.CO2013

The inapproximability for the (0,1)-additive number

Arash Ahadi, Ali Dehghan

An {\it additive labeling} of a graph $G$ is a function $ℓ : V (G) \to N$ , such that for every two adjacent vertices $v$ and $u$ of $G$ , $ \sum_{w \sim v}\el…

cs.CC2013★ 27 cited

The Complexity of the Proper Orientation Number

Arash Ahadi, Ali Dehghan

Graph orientation is a well-studied area of graph theory. A proper orientation of a graph $G = (V, E)$ is an orientation $D$ of $E (G)$ such that for every two adjacent vertices $ v…