The booming of Social Internet Things (SIoT) has witnessed the significance graph mining and analysis for social network management. Online Networks (OSNs) can be efficiently managed by monitoring users’ behaviors within a cohesive group represented maximal clique. They further provide valued intelligence their users. Maximal Cliques Problem (MCP) as fundamental problem in is to identify clique...

We study reconfiguration problems for cliques in a graph, which determine whether there exists a sequence of cliques that transforms a given clique into another one in a step-by-step fashion. As one step of a transformation, we consider three different types of rules, which are defined and studied in reconfiguration problems for independent sets. We first prove that all the three rules are equi...