Skip to main content
Log in

Semigroups of Strong Endomorphisms of Infinite Graphs and Hypergraphs

  • Published:
Ukrainian Mathematical Journal Aims and scope

We define a class of infinite undirected graphs and a class of infinite n-regular hypergraphs and prove that any semigroup of all strong endomorphisms of the graphs and hypergraphs from these classes is isomorphic to the wreath product of a transformation monoid and a small category. We establish the criterional conditions for the regularity of the semigroup of strong endomorphisms of infinite n-regular hypergraphs.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. V. A. Molchanov, “Semigroups of mappings on graphs,” Semigroup Forum, 27, 155–199 (1983).

    Article  MathSciNet  MATH  Google Scholar 

  2. S. H. Fan, “Generalized symmetry of graphs,” Electron. Notes Discrete Math., 23, 51–60 (2005).

    Article  Google Scholar 

  3. A. Kelarev, J. Ryan, and J. Yearwood, “Cayley graphs as classifiers for data mining: The influence of asymmetries,” Discrete Math., 309, No. 17, 5360–5369 (2009).

    Article  MathSciNet  MATH  Google Scholar 

  4. U. Knauer and M. Nieporte, “Endomorphisms of graphs. I. The monoid of strong endomorphisms,” Arch. Math., 52, 607–614 (1989).

    Article  MathSciNet  MATH  Google Scholar 

  5. Yu. V. Zhuchok, “Endomorphism of the relations of equivalence,” Visn. Kyiv. Univ. Ser. Fiz.-Mat. Nauk, 3, 22–26 (2007).

    Google Scholar 

  6. Yu. V. Zhuchok, “Semigroups of endomorphisms of 2-nilpotent binary relations,” Fundam. Prikl. Mat., 14, No. 6, 75–83 (2008).

    Google Scholar 

  7. K. Čulík, “Zur Theorie der Graphen,” Časopis Pěst. Mat., 83, 133–155 (1958).

    MATH  Google Scholar 

  8. M. Böttcher and U. Knauer, “Endomorphism spectra of graphs,” Discrete Math., 109, 45–57 (1992).

    Article  MathSciNet  MATH  Google Scholar 

  9. M. Böttcher and U. Knauer, “Postscript: Endomorphism spectra of graphs,” Discrete Math., 270, 329–331 (2003).

    Article  MathSciNet  MATH  Google Scholar 

  10. E. Wilkeit, “Graphs with a regular endomorphism monoid,” Arch. Math., 66, 344–352 (1996).

    Article  MathSciNet  MATH  Google Scholar 

  11. S. H. Fan, “Graphs whose strong endomorphism monoids are regular,” Arch. Math., 73, 419–421 (1999).

    Article  MATH  Google Scholar 

  12. W.-M. Li, “Green’s relations on the strong endomorphism monoid of a graph,” Semigroup Forum, 47, 209–214 (1993).

    Article  MathSciNet  MATH  Google Scholar 

  13. W.-M. Li, “The monoid of strong endomorphisms of a graph,” Semigroup Forum, 49, 143–149 (1994).

    Article  MathSciNet  MATH  Google Scholar 

  14. E. Bondar, “The monoid of strong endomorphisms of hypergraphs,” in: Abstr. of the Eighth Internat. Algebraic Conference in Ukraine (Luhans’k, July 5–12, 2011), Shevchenko Luhans’k National University, Luhans’k (2011), pp. 248–250.

  15. V. A. Emelichev, O. I. Mel’nikov, V. I. Sarvanov, and R. I. Tyshkevich, Lectures on the Theory of Graphs [in Russian], Nauka, Moscow (1990).

    Google Scholar 

  16. A.V. Reshetnikov, “On the definitions of homomorphisms of hypergraphs,” in: Proc. of the Tenth Internat. Seminar “Discrete Mathematics and Its Applications” (Moscow, February 1–6, 2010) [in Russian], Moscow State University, Moscow (2010), pp. 325–328.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 65, No. 6, pp. 743–754, June, 2013.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bondar’, E.A., Zhuchok, Y.V. Semigroups of Strong Endomorphisms of Infinite Graphs and Hypergraphs. Ukr Math J 65, 823–834 (2013). https://doi.org/10.1007/s11253-013-0820-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11253-013-0820-8

Keywords

Navigation