Graphs and their associated inverse semigroups

From MaRDI portal
Publication:2012528

DOI10.1016/J.DISC.2017.05.008zbMATH Open1367.05100arXiv1506.02093OpenAlexW2962952751MaRDI QIDQ2012528FDOQ2012528


Authors: Tien Chih, Demitri Plessas Edit this on Wikidata


Publication date: 1 August 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Directed graphs have long been used to gain understanding of the structure of semigroups, and recently the structure of directed graph semigroups has been investigated resulting in a characterization theorem and an analog of Fruct's Theorem. We investigate four inverse semigroups defined over undirected graphs constructed from the notions of subgraph, vertex induced subgraph, rooted tree induced subgraph, and rooted path induced subgraph. We characterize the structure of the semilattice of idempotents and lattice of ideals of these four inverse semigroups. Finally, we prove a characterization theorem that states that every graph has a unique associated inverse semigroup up to isomorphism.


Full work available at URL: https://arxiv.org/abs/1506.02093




Recommendations




Cites Work


Cited In (15)





This page was built for publication: Graphs and their associated inverse semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012528)