42 citations · 121 across the 18 of their papers we have counts for
11 papers · 1 filter
On the In-Out-Proper Orientations of Graphs
Ali Dehghan
An orientation of a graph is {\it in-out-proper} if any two adjacent vertices have different in-out-degrees, where the in-out-degree of each vertex is equal to the in-degree mi…
On the maximum number of non attacking rooks on a high-dimensional simplicial chessboard
Arash Ahadi, Mohsen Mollahajiaghaei, Ali Dehghan
The simplicial rook graph is the graph whose vertices are vectors in such that for each vector the summation of its coordinates is and…
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…
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 complexity of deciding whether the regular number is at most two
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
The regular number of a graph G denoted by reg(G) is the minimum number of subsets into which the edge set of G can be partitioned so that the subgraph induced by each subset is re…
Sigma Partitioning: Complexity and Random Graphs
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
A of a graph is a partition of the vertices into sets such that for every two adjacent vertices and there is an index $…
The inapproximability for the (0,1)-additive number
Arash Ahadi, Ali Dehghan
An {\it additive labeling} of a graph is a function , such that for every two adjacent vertices and of , $ \sum_{w \sim v}\el…
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…
On Rainbow Connection of Strongly Regular Graphs
Arash Ahadi, Ali Dehghan
An edge-colored graph is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph ,…
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
Arash Ahadi, Ali Dehghan
A 2-hued coloring of a graph (also known as conditional -coloring and dynamic coloring) is a coloring such that for every vertex of degree at least , the…