Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation

DOI10.1007/s00034-008-9054-7zbMath1173.94472OpenAlexW1997158367MaRDI QIDQ733697

Feng Li, Peng-Yung Woo, Huiliang Shang

Publication date: 19 October 2009

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

Full work available at URL: https://doi.org/10.1007/s00034-008-9054-7

zbMATH Keywords

computational complexitygraph isomorphismadjoint circuitarbitrary graphs

Mathematics Subject Classification ID

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

Related Items (3)

A computational approach to construct a multivariate complete graph invariant ⋮ A new algorithm for isomorphism determination of undirected graphs-circuit simulation method ⋮ The SVE method for regular graph isomorphism identification

Cites Work

• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Unnamed Item

This page was built for publication: Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation