A time-based solution for the graph isomorphism problem

DOI10.1007/S00034-019-01279-8MaRDI QIDQ2192286zbMATH OpenOpenAlexFDO

Authors Morteza Moradi

Publication date 16 August 2020

Published in Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00034-019-01279-8

zbMATH Keywords

graph isomorphismGreshgorin bands in Laplacian matricesisomorphic graphsisomorphism of co-spectral graphsLaplacian matrix

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• A spectral assignment approach for the graph isomorphism problem
• SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM
• scientific article; zbMATH DE number 6503309
• A graph isomorphism algorithm using pseudoinverses
• Physically-motivated dynamical algorithms for the graph isomorphism problem

Cites work

• Affine isomorphism for partially ordered sets
• Consensus of Multiagent Systems and Synchronization of Complex Networks: A Unified Viewpoint
• Enumeration of cospectral graphs.
• Finite-Time Consensus for Leader-Following Second-Order Multi-Agent Networks
• Fractional isomorphism of graphs
• Gershgorin's theorem for matrices of operators
• Graph algebras and the graph isomorphism problem
• scientific article; zbMATH DE number 3722702 (Why is no real title available?)
• scientific article; zbMATH DE number 2102042 (Why is no real title available?)
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Laplacian matrices of graphs: A survey
• P3-isomorphisms for graphs
• Recognition and isomorphism of tree-like \(P_4\)-connected graphs
• Subgraph isomorphism in graph classes
• The isomorphism problem for rose window graphs
• The NP-completeness column
• The SVE method for regular graph isomorphism identification

Cited in

(3)

• Study of graph isomorphism using Jordan forms of adjacency matrices
• Entanglement entropy in the ground state of supersymmetric fermion lattice models
• Laplacian spectrum of two classes of -sum graphs with applications

This page was built for publication: A time-based solution for the graph isomorphism problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2192286)