Skip to main content
SpringerLink
Log in

The Syntactic Complexity of Eulerian Graphs

  • Conference paper
Algebraic Informatics (CAI 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4728))

Included in the following conference series:

Abstract

In this paper we prove that the set of directed Eulerian graphs is not recognizable. On the other hand, the set of directed graphs with an Eulerian underlying graph is shown to be recognizable. Furthermore, we compute the syntactic complexity of this language and we compare it with that of connected graphs.

This research was partially supported by I.K.Y.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnold, A., Dauchet, M.: Théorie des magmoides. I. RAIRO Inform. Théor. 12(3), 235–257 (1978)

    MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  3. Bell, E.T.: Exponential numbers. Amer. Math. Monthly 41, 411–419 (1934)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bozapalidis, S., Kalampakas, A.: An Axiomatization of Graphs. Acta Informatica 41, 19–61 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bozapalidis, S., Kalampakas, A.: Recognizability of graph and pattern languages. Acta Informatica 42, 553–581 (2006)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  8. MacLane, S.: Categories for the working mathematician. Springer, Heidelberg (1971)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technical Institute of Kavala, Department of Exact Sciences, 65404, Kavala, Greece

    Antonios Kalampakas

Authors
  1. Antonios Kalampakas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Symeon Bozapalidis George Rahonis

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kalampakas, A. (2007). The Syntactic Complexity of Eulerian Graphs. In: Bozapalidis, S., Rahonis, G. (eds) Algebraic Informatics. CAI 2007. Lecture Notes in Computer Science, vol 4728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75414-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75414-5_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75413-8

  • Online ISBN: 978-3-540-75414-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation