Computing some role assignments of Cartesian product of graphs

Abstract

In social networks, a role assignment is such that individuals play the same role, if they relate in the same way to other individuals playing counterpart roles. As a simple graph models a social network role assignment rises to the decision problem called r -Role Assignment whether it exists such an assignment of r distinct roles to the vertices of the graph. This problem is known to be NP-complete for any fixed r ≥ 2. The Cartesian product of graphs is one of the most studied operation on graphs and has numerous applications in diverse areas, such as Mathematics, Computer Science, Chemistry and Biology. In this paper, we determine the computational complexity of r -Role Assignment restricted to Cartesian product of graphs, for r = 2,3. In fact, we show that the Cartesian product of graphs is always 2-role assignable, however the problem of 3-Role Assignment is still NP-complete for this class.