Intersection graphs of \(S\)-acts (Q745942): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s40840-014-0098-5 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S40840-014-0098-5 / rank
 
Normal rank

Latest revision as of 02:56, 10 December 2024

scientific article
Language Label Description Also known as
English
Intersection graphs of \(S\)-acts
scientific article

    Statements

    Intersection graphs of \(S\)-acts (English)
    0 references
    0 references
    0 references
    15 October 2015
    0 references
    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.
    0 references
    0 references
    \(S\)-act
    0 references
    intersection graph
    0 references
    connectivity
    0 references
    diameter
    0 references
    girth
    0 references

    Identifiers