Suani Tavares Rubim de Pinho

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this note we address the problem of graph isomorphism by means of eigenvalue spectra of different matrix representations: the neighborhood matrix M̂ , its corresponding signless Laplacian QM̂ , and the set of higher order adjacency matrices M`s. We find that, in relation to graphs with at most 10 vertices, QM̂ leads to better results than the signless(More)
  • 1