SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM

DOI10.1142/S0129054109006693zbMath1184.05084MaRDI QIDQ3636158

Sanguthevar Rajasekaran, Vamsi Krishna Kundeti

Publication date: 30 June 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

algorithmseigenvaluesspectracospectral graphsgraph isomorphism

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Constructing cospectral graphs
• Enumeration of cospectral graphs.
• The Determinant of the Adjacency Matrix of a Graph
• An Algorithm for Subgraph Isomorphism
• A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices

This page was built for publication: SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM