A time-based solution for the graph isomorphism problem

DOI10.1007/s00034-019-01279-8zbMath1445.05071OpenAlexW2977830112MaRDI QIDQ2192286

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

Laplacian matrixgraph isomorphismisomorphic graphsGreshgorin bands in Laplacian matricesisomorphism of co-spectral graphs

Mathematics Subject Classification ID

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

Cites Work

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