3 papers
math.CO2019
An Efficient Structural Descriptor Sequence to Identify Graph Isomorphism and Graph Automorphism
Sivakumar Karunakaran, Lavanya Selvaganesh
In this paper, we study the graph isomorphism and graph automorphism problems. We propose a novel technique to analyze graph isomorphism and graph automorphism. Further we handled…
cs.DM2019
An Unique and Novel Graph Matrix for Efficient Extraction of Structural Information of Networks
Sivakumar Karunakaran, Lavanya Selvaganesh
In this article, we propose a new type of square matrix associated with an undirected graph by trading off the naturally imbedded symmetry in them. The proposed matrix is defined u…
cs.DS2019
Efficient Shortest Path Algorithm Using An Unique And Novel Graph Matrix Representation
Sivakumar Karunakaran, Lavanya Selvaganesh
The neighbourhood matrix, , a novel representation of graphs proposed in \cite {ALPaper} is defined using the neighbourhood sets of the vertices. The matrix also e…