On the public citation graph

Endomorphisms of graphs I. The monoid of strong endomorphisms

0 signed · 55 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.3190110316openalex-snapshot

Unretractive and S‐unretractive joins and lexicographic products of graphs

inferredcites →https://doi.org/10.1007/bf01210984openalex-snapshot

Graph derivatives

inferredcites →https://doi.org/10.1007/bf01297617openalex-snapshot

Symmetric relations (undirected graphs) with given semigroups

inferredcites →https://doi.org/10.1007/bf02485713openalex-snapshot

On some strongly rigid families of graphs and the full embeddings they induce

inferredcites →https://doi.org/10.1007/bf02572746openalex-snapshot

Wreath products of ordered semigroups

inferredcites →https://doi.org/10.1007/bfb0083423openalex-snapshot

Endomorphism monoids of acts are wreath products of monoids with small categories

inferredcites →https://doi.org/10.1016/s0021-9800(68)80017-1openalex-snapshot

The group of an X-join of graphs

inferredcites →https://doi.org/10.1215/s0012-7094-59-02667-5openalex-snapshot

The composition of graphs

inferredcites →https://doi.org/10.21136/cpm.1958.108307openalex-snapshot

To the graph theory

inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot

GRAPH THEORY

inferredcites →https://doi.org/10.4153/cjm-1966-121-7openalex-snapshot

On Rigid Undirected Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/eujc.2000.0443openalex-snapshot

Endomorphism—Regularity of Split Graphs

inferred← citeshttps://doi.org/10.1006/jabr.2001.8788openalex-snapshot

Divisible, Torsion-Free, and Act Regular Generalized Act Wreath Products

inferred← citeshttps://doi.org/10.1007/bf01189142openalex-snapshot

Endomorphisms of graphs II. Various unretractive graphs

inferred← citeshttps://doi.org/10.1007/bf01207836openalex-snapshot

Graphs with a regular endomorphism monoid

inferred← citeshttps://doi.org/10.1007/bf02248747openalex-snapshot

Inverses and pseudo-inverses of a strong endomorphism of a graph

inferred← citeshttps://doi.org/10.1007/bf02573480openalex-snapshot

The monoid of strong endomorphisms of a graph

inferred← citeshttps://doi.org/10.1007/bf02573757openalex-snapshot

Green's relations on the strong endomorphism monoid of a graph

inferred← citeshttps://doi.org/10.1007/bf02670969openalex-snapshot

Inverse monoids of graphs

inferred← citeshttps://doi.org/10.1007/bf03325440openalex-snapshot

Green’s relations in some categories of strong graph homomorphisms

inferred← citeshttps://doi.org/10.1007/s000130050418openalex-snapshot

Graphs whose strong endomorphism monoids are regular

inferred← citeshttps://doi.org/10.1007/s00233-021-10228-4openalex-snapshot

Endotypes of partial equivalence relations

inferred← citeshttps://doi.org/10.1007/s00373-019-02109-zopenalex-snapshot

Naturally ordered strong endomorphisms on graphs

inferred← citeshttps://doi.org/10.1007/s10910-016-0653-4openalex-snapshot

Semigroup theory of symmetry

inferred← citeshttps://doi.org/10.1007/s10958-012-1057-zopenalex-snapshot

Endomorphism semigroups of some free products

inferred← citeshttps://doi.org/10.1007/s10958-014-2001-1openalex-snapshot

Representations of the Strong Endomorphism Monoid of Finite n-Uniform Hypergraphs

inferred← citeshttps://doi.org/10.1007/s11253-013-0820-8openalex-snapshot

Semigroups of Strong Endomorphisms of Infinite Graphs and Hypergraphs

inferred← citeshttps://doi.org/10.1007/s11253-025-02431-1openalex-snapshot

The Semigroup of Weak Endomorphisms of a Partial Equivalence Relation

inferred← citeshttps://doi.org/10.1007/s11766-998-0038-yopenalex-snapshot

An approach to construct an end-regular graph

inferred← citeshttps://doi.org/10.1016/0012-365x(92)90277-mopenalex-snapshot

Endomorphism spectra of graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2005.01.007openalex-snapshot

Various inverses of a strong endomorphism of a graph

inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.094openalex-snapshot

Graphs whose endomorphism monoids are regular

inferred← citeshttps://doi.org/10.1016/j.disc.2008.11.039openalex-snapshot

On unretractive graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2009.02.027openalex-snapshot

Generalized symmetry of graphs — A survey

inferred← citeshttps://doi.org/10.1016/j.disc.2009.10.021openalex-snapshot

On wreathed lexicographic products of graphs

inferred← citeshttps://doi.org/10.1016/j.endm.2005.07.078openalex-snapshot

On unretractive graphs

inferred← citeshttps://doi.org/10.1016/j.endm.2005.07.079openalex-snapshot

Generalized symmetry of graphs

inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00388-6openalex-snapshot

Retractions of split graphs and End-orthodox split graphs

inferred← citeshttps://doi.org/10.1016/s0252-9602(17)30857-3openalex-snapshot

LEFT INVERSES AND RIGHT INVERSES OF A STRONG ENDOMORPHISM OF A GRAPH

inferred← citeshttps://doi.org/10.1070/sm2014v205n05abeh004392openalex-snapshot

The endotopism semigroups of an equivalence relation

inferred← citeshttps://doi.org/10.1080/00927872.2016.1233977openalex-snapshot

End-regularity of zero-divisor graphs of group rings

inferred← citeshttps://doi.org/10.1112/s0025579300007282openalex-snapshot

A regular endomorphism of a graph and its inverses

inferred← citeshttps://doi.org/10.1134/s0001434615010228openalex-snapshot

Correspondences of the semigroup of endomorphisms of an equivalence relation

inferred← citeshttps://doi.org/10.1134/s0037446621060069openalex-snapshot

The Endotopism Semigroups of a Partial Equivalence Relation

inferred← citeshttps://doi.org/10.1142/s1793557118500596openalex-snapshot

On the endomorphism monoids of Clifford semigroups

inferred← citeshttps://doi.org/10.1142/s1793830916500208openalex-snapshot

Unicyclic graphs with regular endomorphism monoids

inferred← citeshttps://doi.org/10.12677/ojns.2022.106130openalex-snapshot

The Pseudo-Inverses of an Endomorphism of the Complement Graph of Path

inferred← citeshttps://doi.org/10.12958/adm2157openalex-snapshot

The presentation of deterministic and strongly deterministic graphs

inferred← citeshttps://doi.org/10.17223/20710410/25/1openalex-snapshot

On the regularity of some subsemigroups of equivalence relation's endomorphism monoid

inferred← citeshttps://doi.org/10.33048/smzh.2021.62.606openalex-snapshot

The endotopism semigroups of a partial equivalence relation

inferred← citeshttps://doi.org/10.3390/math11143214openalex-snapshot

Endomorphism Spectra of Double-Edge Fan Graphs

inferred← citeshttps://doi.org/10.3842/umzh.v76i12.8412openalex-snapshot

Напівгрупа слабких ендоморфізмів відношення часткової еквівалентності

inferred← citeshttps://doi.org/10.4213/mzm10374openalex-snapshot

Соответствия полугруппы эндоморфизмов отношения эквивалентности

inferred← citeshttps://doi.org/10.4213/sm8325openalex-snapshot

Полугруппы эндотопизмов отношения эквивалентности

inferred← citeshttps://doi.org/10.5562/cca2303openalex-snapshot

Color Symmetry, Semigroups, Fractals

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.