The SVE method for regular graph isomorphism identification

DOI10.1007/S00034-015-0030-8MaRDI QIDQ737027zbMATH OpenOpenAlexWikidataFDO

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)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(3)

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

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)