The SVE method for regular graph isomorphism identification

DOI10.1007/S00034-015-0030-8zbMATH Open1357.94113OpenAlexW1972978604WikidataQ59436424 ScholiaQ59436424MaRDI QIDQ737027FDOQ737027

Authors: Huiliang Shang, Feng Kang, Chen Xu, Siyuan Zhang, Guo-Bin Chen 

Publication date: 5 August 2016

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

Full work available at URL: https://doi.org/10.1007/s00034-015-0030-8

Recommendations

• Algorithmic aspects of algebraic methods for graph isomorphism testing
• scientific article; zbMATH DE number 7403940
• Performance analysis on connectivity structure of regular graphs for isomorphism
• Isomorphism testing algorithm for graphs: Incidence degree sequence method and applications
• Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation

zbMATH Keywords

graph isomorphismregular graphcircuit simulation methodsingle-vertex excitation (SVE) method

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cites Work

• A graph isomorphism algorithm for object recognition
• Polynomial algorithms for open plane graph and subgraph isomorphisms
• Compatible topologies on graphs: an application to graph isomorphism problem complexity
• Applied graph theory in computer vision and pattern recognition
• Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation

Cited In (3)

• A novel approach for detection and elimination of automorphic graphs in graph databases
• Entanglement entropy in the ground state of supersymmetric fermion lattice models
• A time-based solution for the graph isomorphism problem

This page was built for publication: The SVE method for regular graph isomorphism identification

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