Intersection graphs of S-acts

DOI10.1007/S40840-014-0098-5MaRDI QIDQ745942zbMATH OpenOpenAlexFDO

Authors Hamid Rasouli, Abolfazl Tehranian

Publication date 15 October 2015

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40840-014-0098-5

\(S\)-act connectivity diameter girth intersection graph

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Representation of semigroups; actions of semigroups on sets (20M30)

Review text

The intersection graph \(G(A)\) of an \(S\)-act \(A\) is undirected, has the non-trivial subacts of \(A\) as vertices, two of which are adjacent if their intersection is non-empty. Let \(S\) be a monoid. The authors prove for example: If \(G(A)\) is connected then \(\mathrm{diam}(G(A))\leq 2\), if it contains a cycle then \(\mathrm{girth}(G(A))=3\). Suppose that \(A\) is non-cyclic. If \(A\) is free or projective then \(G(A)\) is connected iff \(|G(A)|\geq 6\), in this case \(\mathrm{diam}(G(A))= 2\) and \(\mathrm{girth}(G(A))=3\). Similar results are presented if \(S\) is a group.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Intersection graphs of \(S\)-acts

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