Efficient Algorithm for Graph Isomorphism Problem

EasyChair Preprint 798, version 4

Abstract

In  this  research  paper,  efficient  algorithms  for  Graph  Isomophism  problem  are  discussed  under  some  conditions.  Also  interesting  results  in  Spectral  Graph  Theory  are  discussed

Keyphrases: Eigenvectors, Permutation Matrices, eigenvalues, isomorphic graphs, spectral representation

@booklet{EasyChair:798,
  author    = {Rama Murthy Garimella},
  title     = {Efficient  Algorithm  for  Graph  Isomorphism  Problem},
  howpublished = {EasyChair Preprint 798},
  year      = {EasyChair, 2020}}