On the public citation graph
Endomorphisms of graphs II. Various unretractive graphs
0 signed · 29 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.
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.
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/bf01237575openalex-snapshot
Endomorphisms of graphs I. The monoid of strong endomorphisms
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/jctb.1996.0068openalex-snapshot
Cores and Compactness of Infinite Directed 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/bf03325440openalex-snapshot
Green’s relations in some categories of strong graph homomorphisms
inferred← citeshttps://doi.org/10.1007/s00373-019-02109-zopenalex-snapshot
Naturally ordered strong endomorphisms on graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90277-mopenalex-snapshot
Endomorphism spectra of graphs
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.2007.08.057openalex-snapshot
On endomorphism-regularity of zero-divisor 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.079openalex-snapshot
Generalized symmetry of graphs
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.1142/s1793830916500208openalex-snapshot
Unicyclic graphs with regular endomorphism monoids
inferred← citeshttps://doi.org/10.3390/math11143214openalex-snapshot
Endomorphism Spectra of Double-Edge Fan Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2007.01842openalex-snapshot
Incidence Hypergraphs: Box Products & the Laplacian
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.