Abstract

Combinatorial characteristics of Green's relations on the monoid of strong endomorphisms of graphs are explored. As an application, a short proof of the fact thats End(G) is regular is given.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call