2 papers
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…
math.CO2016
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…