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 2017 · math.COShow all

2 papers · 2 filters

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 $G$ is a labeling of the edge set in $G$ such that in every orientation $ℓ$ of $G$ for every two adjacent vertices $v$ and $u$ , the sum of…

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…