Skip to main content
SpringerLink
Log in

A New Algorithm for Isomorphism Determination of Undirected Graphs-Circuit Simulation Method

  • Published:
Circuits, Systems, and Signal Processing Aims and scope Submit manuscript

Abstract

In this article, an important property of the associated circuits of isomorphic graphs is proved and therefore a criterion for the determination of the isomorphism of two undirected graphs is obtained. With the use of this approach, the isomorphism of two undirected graphs can be determined quickly. The approach proposed is applied to arbitrary connected graphs and irregular 2D meshes for graph isomorphism determination and satisfactory results are achieved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. Agusa, S. Fujita, M. Yamashita, T. Ae, On neural networks for graph isomorphism problem, in RNNS/IEEE Symposium on Neuroinformatics and Neurocomputers (Oct 1992), pp. 1142–1148

    Chapter  Google Scholar 

  2. C.K. Alexander, Fundamentals of Electric Circuits. McGraw–Hill Science Engineering (2004)

    Google Scholar 

  3. J. Cai et al., The genetic algorithm for graph isomorphism. Proc. SuZhou Sci. Technol. Coll., 23(1), 35–38 (2006) (in Chinese)

    MATH  Google Scholar 

  4. L. Chen et al., The parallel algorithm for isomorphism determination of undirected graphs. Comput. Eng. 28(6), 39–40 (2002) (in Chinese)

    Google Scholar 

  5. D. Conte, P. Foggia, C. Sansone, M. Vento, Thirty years of graph matching in pattern recognition. Int. J. Pattern Recognit. Artif. Intell. 18(3), 265–298 (2004)

    Article  Google Scholar 

  6. L.P. Cordella, M. Vento, Symbol recognition in documents: a collection of techniques. Int. J. Doc. Anal. Recognit. 3, 73–88 (2000)

    Article  Google Scholar 

  7. P. Foggia, C. Sansone, M. Vento, A database of graphs for isomorphism and sub graph isomorphism benchmarking, in Int’l Workshop on Graph-Based Representations in Pattern Recognition, Italy (2001), pp. 176–188

    Google Scholar 

  8. P.J.B. Hancock, Genetic algorithms and permutation problems: a comparison of recombination operators for neural network structure specification, in 1992 International Workshop on Combinations of Genetic Algorithms and Neural Networks, Baltimore (1992), pp. 108–122

    Chapter  Google Scholar 

  9. F. Harary, Graph Theory (1981)

    Google Scholar 

  10. L. Jianzhuang, L.Y. Tsui, Graph-based method for face identification from a single 2D line drawing. IEEE Trans. Pattern Anal. Mach. Intell. 23(10), 1106–1119 (2001)

    Article  Google Scholar 

  11. F. Li, S.-Y. Li, An algorithm for graph isomorphism determination—degree distribution sequence method and its application. J. Fudan Univ. (Nat. Sci.) 40(3), 318–325 (2001) (in Chinese)

    MathSciNet  MATH  Google Scholar 

  12. F. Li, H.-L. Shang, P.-Y. Woo, Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation. Circuits Syst. Signal Process. 27(5), 749–761 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. N. Lloyd et al., Numerical Linear Algebra (SIAM, Philadelphia, 1997)

    MATH  Google Scholar 

  14. B.T. Messmer, Efficient graph matching algorithms for preprocessed model graphs. PhD Thesis, Inst. of Computer Science and Applied Mathematics, Univ. of Bern (1996)

  15. M. Pelillo, Replicator equations, maximal cliques, and graph isomorphism. Neural Comput. 11(8), 1933–1955 (1999)

    Article  Google Scholar 

  16. H.-L. Shang, F. Li, An algorithm for isomorphism determination of undirected graphs: circuit simulation method, in 2009 Annual Meeting of Chinese Professional Committee of Graph Theory and System Optimization, Harbin, China (2009), pp. 56–63 (in Chinese)

    Google Scholar 

  17. P. Stagge, C. Igel, Neural network structures and isomorphism: random walk characteristics of the search space, in IEEE Symposium on Combinations of Evolutionary Computation and Neural Networks (ECNN 2000) (2000), pp. 82–90

    Chapter  Google Scholar 

  18. W. Zang, F. Li, The algorithm for isomorphism determination of arbitrary connected graphs: the eigenvector method. Comput. Aided Des. Graphs 19(2), 163–167 (2007) (in Chinese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic Engineering, Fudan University, Shanghai, China

    Huiliang Shang, Feng Li & XianDing Tang

  2. Department of Electrical Engineering, Northern Illinois University, DeKalb, IL, 60115, USA

    Peng-Yung Woo

Authors
  1. Huiliang Shang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Feng Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. XianDing Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Peng-Yung Woo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peng-Yung Woo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shang, H., Li, F., Tang, X. et al. A New Algorithm for Isomorphism Determination of Undirected Graphs-Circuit Simulation Method. Circuits Syst Signal Process 30, 1115–1130 (2011). https://doi.org/10.1007/s00034-010-9248-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00034-010-9248-7

Keywords

Search

Navigation