Skip to main content
Springer Nature Link
Log in

An axiomatization of graphs

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

The magmoid of hypergraphs labelled over a finite doubly ranked alphabet, is characterized as the quotient of the free magmoid generated by this alphabet divided by a finite set of equations. Thus a relevant open problem, posed by Engelfriet and Vereijken, is being solved.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Arnold, A., Dauchet, M. (1978) Théorie des magmoides. I. RAIRO Inform. Théor 12(3): 235-257

  2. Arnold, A., Dauchet, M. (1979) Théorie des magmoides. II. RAIRO Inform. Théor 13(2): 135-154

  3. Bauderon, M., Courcelle, B. (1987) Graph expressions and graph rewritings. Math. Syst. Theory 20: 83-127

    MATH  Google Scholar 

  4. Bossut, F., Dauchet, M., Warin, B. (1995) A Kleene theorem for a class of planar acyclic graphs. Inform. and Comput. 117: 251-265

    Google Scholar 

  5. Bruni, R., Gadducci, F., Montanari, U. (2002) Normal forms for algebras of connections. Theoret. Comp. Sci. 286: 247-292

    Google Scholar 

  6. Claus, V. (1971) Ein Vollständigkeitssatz für Programme und Schaltkreise. Acta Informatica 1: 64-78

    Article  MATH  Google Scholar 

  7. Corradini, A., Gadducci, F. (1999) An algebraic presentation of term graphs, via gs-monoidal categories. Appl. Categ. Structures 7(4): 299-331

    Article  MATH  Google Scholar 

  8. Căzănescu, V.E., Ştefănescu, Gh. (1991) Classes of finite relations as initial abstract data types I. Discrete Mathematics 90: 233-265

    Article  Google Scholar 

  9. Căzănescu, V.E., Ştefănescu, Gh. (1992) A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization. Theoret. Comput. Sci. 99: 1-63

  10. Engelfriet, J., Vereijken, J.J. (1997) Context-free graph grammars and concatenation of graphs. Acta Informatica 34: 773-803

    Article  MATH  Google Scholar 

  11. Gadducci, F., Heckel, R. (1997) An inductive view of graph transformation. Recent Trends in Algebraic Development Techniques (Tarquinia 1997). Lecture Notes in Computer Science 1376, Springer, Berlin Heidelberg New York, pp. 223-237

  12. Gibbons, J. (1995) An initial-algebra approach to directed acyclic graphs. Mathematics of program construction (Kloster Irsee, 1995). Lecture Notes in Computer Science 947. Springer, Berlin Heidelberg New York, pp. 282-303

  13. Hotz, G. (1965) Eine Algebraisierung des Syntheseproblems von Schaltkreisen. EIK 1: 185-205, 209-231

    MATH  Google Scholar 

  14. Hotz, G. (1966) Eindeutigkeit und Mehrdeutigkeit formaler Sprachen. EIK 2: 235-246

    MATH  Google Scholar 

  15. Kamimura, T., Slutzki, G. (1981) Parallel and two-way automata on directed ordered acyclic graphs. Inform. and Control 49: 10-51

    MATH  Google Scholar 

  16. MacLane, S. (1971) Categories for the working mathematician. Springer, Berlin Heidelberg New York

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Aristotle University of Thessaloniki, 54006, Thessaloniki, Greece

    Symeon Bozapalidis & Antonios Kalampakas

Authors
  1. Symeon Bozapalidis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonios Kalampakas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Symeon Bozapalidis.

Additional information

Received: 27 April 2004, Published online: 14 October 2004

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bozapalidis, S., Kalampakas, A. An axiomatization of graphs. Acta Informatica 41, 19–61 (2004). https://doi.org/10.1007/s00236-004-0149-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-004-0149-8

Keywords

Search

Navigation