Skip to main content
SpringerLink
Log in

A criterion for recognizing similarity in graphs

  • Published:
CALCOLO Aims and scope Submit manuscript

Abstract

The relation of similarity on graphs, as given in a previous paper, is redefined here by using the theory of structural numbers.

It is shown how to recignize whether two graph are similar by simple computation on the corresponding structural numbers.

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. Maria Staniszkis,The Relation of Similarity of Graphs and some of its Properties, Rapporto di ricerca del Laboratorio per la Dinamica dei Sistemi del CNR di Padova, (ottobre 1974).

  2. S. Bellert, M. Wozniacki;Analiza i Synteza Ukladòw Elektrycznych Metoda Liczb Strukturalnych, (1968), WNT, Warsaw.

    Google Scholar 

  3. F. Harary,Graph Theory, (1969), Addison-Wesley, Reading.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrical Engineering Department, University of Trieste, Trieste, Italy

    M. Staniszkis Marzollo

Authors
  1. M. Staniszkis Marzollo
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Staniszkis Marzollo, M. A criterion for recognizing similarity in graphs. Calcolo 13, 351–359 (1976). https://doi.org/10.1007/BF02575940

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02575940

Keywords

Search

Navigation