\(D\)-saturated property of the Cayley graphs of semigroups. (Q2267782)

From MaRDI portal
scientific article
Language Label Description Also known as
English
\(D\)-saturated property of the Cayley graphs of semigroups.
scientific article

    Statements

    \(D\)-saturated property of the Cayley graphs of semigroups. (English)
    0 references
    0 references
    0 references
    2 March 2010
    0 references
    Let \(S\) be a semigroup and \(T\) be a subset of \(S\), then a digraph on the set \(S\) formed by all arcs \((u,v)\) with \(v=tu\) for some \(t\in T\) is the Cayley graph \(\text{Cay}(S,T)\) of \(S\) relative to \(T\). Let \(D\) be a finite digraph. Then \(S\) is Cayley \(D\)-saturated with respect to \(T\) if for every infinite set \(V\subseteq S\) there exists a subdigraph of \(\text{Cay}(S,T)\) on a subset of \(V\) isomorphic to \(D\). It is proved: If \(D\) is a finite digraph without cycle then \(S\) is Cayley \(D\)-saturated with respect to \(T\) if and only if for every infinite set \(V\subseteq S\) there exists an arc \((u,v)\) of \(\text{Cay}(S,T)\) for some distinct \(u,v\in V\). If \(S\) is Cayley \(D\)-saturated with respect to \(T\) for some finite digraph \(D\) without cycle then \(S\) is Cayley \(D_1\)-saturated with respect to \(T\) for all finite digraphs \(D_1\) without cycle. If \(D\) is a finite digraph with a cycle then \(S\) is Cayley \(D\)-saturated with respect to \(T\) if and only if \(\text{Cay}(S,T)\) is a finite disjoint union of complete symmetric digraphs. If \(S\) is Cayley \(D\)-saturated with respect to \(T\) for some finite digraph \(D\) with a cycle then \(S\) is Cayley \(D_1\)-saturated with respect to \(T\) for all finite digraphs \(D_1\).
    0 references
    0 references
    0 references
    0 references
    0 references
    semigroups
    0 references
    digraphs
    0 references
    Cayley graphs
    0 references
    \(D\)-saturated property
    0 references
    0 references