Critical Node Identification in complex network

This book contributes three things first we introduce a new approach based on the decomposition of a graph into triangle structured subgraphs and second we introduce new centrality measure which views those decompose subgraphs as a planar mechanism and calculate the sum of the local degree of freedom of node I with the summation of all edges in the subgraph which we socially consider it as the local power of a node. The third is we comprehensively used three measures with a different perspective on node power complex networks to identify the most powerful node in a given complex network and the reason behind using three measures is to obtain more objective and reasonable ranking results.