Download PDFOpen PDF in browser

Efficient Algorithm for Graph Isomorphism Problem

EasyChair Preprint no. 798, version 5

Versions: 12345history
13 pagesDate: March 2, 2020


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: eigenvalues, Eigenvectors, isomorphic graphs, Permutation Matrices, spectral representation

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
  author = {Rama Murthy Garimella},
  title = {Efficient  Algorithm  for  Graph  Isomorphism  Problem},
  howpublished = {EasyChair Preprint no. 798},

  year = {EasyChair, 2020}}
Download PDFOpen PDF in browser