On the public citation graph

Graphs with a regular endomorphism monoid

https://doi.org/10.1007/bf01207836
0 signed · 45 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.3190030404openalex-snapshot
Fixed‐edge theorem for graphs with loops
inferredcites →https://doi.org/10.1002/jgt.3190080407openalex-snapshot
Retracts of hypercubes
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/bf01189142openalex-snapshot
Endomorphisms of graphs II. Various unretractive graphs
inferredcites →https://doi.org/10.1007/bf01237575openalex-snapshot
Endomorphisms of graphs I. The monoid of strong endomorphisms
inferredcites →https://doi.org/10.1007/bf01297617openalex-snapshot
Symmetric relations (undirected graphs) with given semigroups
inferredcites →https://doi.org/10.1016/0012-365x(92)90054-jopenalex-snapshot
The retracts of Hamming graphs
inferredcites →https://doi.org/10.1016/0166-218x(87)90058-8openalex-snapshot
Absolute retracts of bipartite graphs
inferredcites →https://doi.org/10.1016/s0195-6698(89)80053-8openalex-snapshot
DismantlinG Absolute Retracts of Reflexive Graphs
inferredcites →https://doi.org/10.1111/j.1749-6632.1979.tb17773.xopenalex-snapshot
AN INTRODUCTION TO THE CATEGORY OF GRAPHS*
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY

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.1007/s00233-021-10193-yopenalex-snapshot
Partial automorphisms and injective partial endomorphisms of a finite undirected path
inferred← citeshttps://doi.org/10.1007/s00373-019-02109-zopenalex-snapshot
Naturally ordered strong endomorphisms on graphs
inferred← citeshttps://doi.org/10.1007/s10801-026-01519-6openalex-snapshot
Presentations for monoids of partial endomorphisms of a star graph
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/s11766-998-0038-yopenalex-snapshot
An approach to construct an end-regular graph
inferred← citeshttps://doi.org/10.1007/s40840-019-00762-4openalex-snapshot
Ranks of Monoids of Endomorphisms of a Finite Undirected Path
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.11.002openalex-snapshot
End-regularity of generalized bicycle 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.2007.08.057openalex-snapshot
On endomorphism-regularity of zero-divisor graphs
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.disc.2019.111655openalex-snapshot
Trees whose regular endomorphisms form a monoid
inferred← citeshttps://doi.org/10.1016/j.ejc.2007.06.026openalex-snapshot
The endomorphism monoid of Pn¯
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.1080/00927872.2016.1233977openalex-snapshot
End-regularity of zero-divisor graphs of group rings
inferred← citeshttps://doi.org/10.1080/09720529.2014.927639openalex-snapshot
End-regular and End-orthodox lexicographic products of bipartite graphs
inferred← citeshttps://doi.org/10.1080/09728600.2024.2434069openalex-snapshot
On endomorphism-regularity of ( n , n + 1)-graphs
inferred← citeshttps://doi.org/10.1142/s1793557123500699openalex-snapshot
On the rank of monoids of endomorphisms of a finite directed path
inferred← citeshttps://doi.org/10.1142/s1793557125500494openalex-snapshot
Presentations for monoids of endomorphisms of a star graph
inferred← citeshttps://doi.org/10.1142/s1793830916500208openalex-snapshot
Unicyclic graphs with regular endomorphism monoids
inferred← citeshttps://doi.org/10.1155/2014/432073openalex-snapshot
End-Completely-Regular and End-Inverse Lexicographic Products of Graphs
inferred← citeshttps://doi.org/10.1515/math-2016-0021openalex-snapshot
End-regular and End-orthodox generalized lexicographic products of bipartite graphs
inferred← citeshttps://doi.org/10.1515/math-2017-0071openalex-snapshot
The join of split graphs whose completely regular endomorphisms form a monoid
inferred← citeshttps://doi.org/10.1515/ms-2024-0078openalex-snapshot
On monoids of endomorphisms of a cycle graph
inferred← citeshttps://doi.org/10.19026/rjaset.5.4908openalex-snapshot
End-Regularity of the Join of n Split Graphs
inferred← citeshttps://doi.org/10.2298/fil2520983kopenalex-snapshot
The maximal subsemigroups of the singular part of endomorphism monoids of the star graphs
inferred← citeshttps://doi.org/10.2989/16073606.2024.2374796openalex-snapshot
On partial endomorphisms of a star graph
inferred← citeshttps://doi.org/10.3390/math8020240openalex-snapshot
Unicyclic Graphs Whose Completely Regular Endomorphisms form a Monoid
inferred← citeshttps://doi.org/10.55016/ojs/cdm.v17i1.62338openalex-snapshot
The endomorphisms monoids of Helm graph and its generalization
inferred← citeshttps://doi.org/10.7494/opmath.2021.41.1.55openalex-snapshot
More on linear and metric tree maps
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.