Abstract
Congruences on a graph inverse semigroup were recently described in terms of the underline graph. Based on such descriptions, we show that the congruence lattice of a graph inverse semigroup is upper semimodular but not lower semimodular.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
