42 citations · 169 across the 26 of their papers we have counts for
4 papers · 1 filter
Use of Eigenvector Centrality to Detect Graph Isomorphism
Natarajan Meghanathan
Graph Isomorphism is one of the classical problems of graph theory for which no deterministic polynomial-time algorithm is currently known, but has been neither proven to be NP-com…
Probabilistic Diffusion in Random Network Graphs
Natarajan Meghanathan
In this paper, we consider a random network such that there could be a link between any two nodes in the network with a certain probability (plink). Diffusion is the phenomenon of…
Distribution of maximal clique size of the vertices for theoretical small-world networks and real-world networks
Natarajan Meghanathan
Our primary objective in this paper is to study the distribution of the maximal clique size of the vertices in complex networks. We define the maximal clique size for a vertex as t…
Using Spectral Radius Ratio for Node Degree to Analyze the Evolution of Scale Free Networks and Small World Networks
Natarajan Meghanathan
In this paper, we show the evaluation of the spectral radius for node degree as the basis to analyze the variation in the node degrees during the evolution of scale-free networks a…