Skip to main content
Log in

Endomorphism Classes of Ordered Sets, Graphs and Lattices

  • Published:
Order Aims and scope Submit manuscript

Abstract

Given a structure S, what other structures S' on the same underlying set satisfy End S \( \subseteq\) End S'?

We answer this question for the cases of ordered sets, reflexive graphs, irreflexive bipartite graphs and lattices.

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. Escalante, F., Montejano, L. and Rojano, T. (1974) Characterization of n-path graphs and graphs having n-th root, JCTB 154, 282-289.

    Google Scholar 

  2. Gluskin, L. M. (1961) Semigroups of isotone transformations, Uspekhi Mat. Nauk 16, 157-162.

    Google Scholar 

  3. Hedrlin, Z. and Pultr, A. (1966) On rigid undirected graphs, Canad. J. Math. 18, 1237-1242.

    Google Scholar 

  4. Motwani, R. and Sudan, M. (1994) Computing roots of graphs is hard, DAM 54, 81-88.

    Google Scholar 

  5. Mukhopadhyay, A. (1967) The square root of a graph, JCT 2, 290-295.

    Google Scholar 

  6. Schein, B. M. (1970) Ordered sets, semilattices, distributive lattices and Boolean algebras with homomorphic endomorphism semigroups, Fund. Math. LXVIII, 31-50.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gibson, P., Zaguia, I. Endomorphism Classes of Ordered Sets, Graphs and Lattices. Order 15, 21–34 (1998). https://doi.org/10.1023/A:1006010725949

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1006010725949

Navigation