Generalized Cayley graphs of semigroups. I. (Q415542): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
The study of Cayley graphs of semigroups and its valuable applications, is a very important research area which is closely related to finite state automata (see the survey by \textit{A. Kelarev, J. Ryan} and \textit{J. Yearwood}, [Discrete Math. 309, No. 17, 5360-5369 (2009; Zbl 1206.05050)] and Section 2.4 of the book by \textit{A. Kelarev}, [Graph algebras and automata. New York: Marcel Dekker (2003; Zbl 1070.68097)]). In this paper, the author first presents the following definition of generalized Cayley graphs of semigroups to unify the Cayley graphs of semigroups defined by right translations and left translations (note that the classical definition of Cayley graphs has no problem and the difference between the results about Cayley graphs defined by left and right actions, is because of the close relation between semigroups and these structures (similar to left and right \(S\)-acts)). Let \(T\) be an ideal extension of a semigroup \(S\) and \(\rho\subseteq T^1\times T^1\). The `generalized Cayley graph' \(\text{Cay}(S,\rho)\) of \(S\) relative to \(\rho\) is defined as the graph with vertex set \(S\) and edge set \(E(\text{Cay}(S,\rho))\) consisting of those ordered pairs \((a,b)\), where \(xay=b\) for some \((x,y)\in\rho\). The generalized Cayley graph \(\text{Cay}(S,\omega)\), where \(\omega=S^1\times S^1\) is called `universal Cayley graph of \(S\)'. Clearly, for \(\rho_1=T^1\times \{1\}\) and \(\rho_2=\{1\}\times T^1\), \(\text{Cay}(S,\rho_1)\) and \(\text{Cay}(S,\rho_2)\) are the classical definition of Cayley graph of semigroup defined by left and right transformations, respectively. After presenting some fundamental properties and general results about generalized Cayley graphs of semigroups, the author focuses on universal Cayley graphs and after introducing some notions, she describes the universal Cayley graph of a \(\mathcal J\)-partial order of complete graphs with loops. | |||
Property / review text: The study of Cayley graphs of semigroups and its valuable applications, is a very important research area which is closely related to finite state automata (see the survey by \textit{A. Kelarev, J. Ryan} and \textit{J. Yearwood}, [Discrete Math. 309, No. 17, 5360-5369 (2009; Zbl 1206.05050)] and Section 2.4 of the book by \textit{A. Kelarev}, [Graph algebras and automata. New York: Marcel Dekker (2003; Zbl 1070.68097)]). In this paper, the author first presents the following definition of generalized Cayley graphs of semigroups to unify the Cayley graphs of semigroups defined by right translations and left translations (note that the classical definition of Cayley graphs has no problem and the difference between the results about Cayley graphs defined by left and right actions, is because of the close relation between semigroups and these structures (similar to left and right \(S\)-acts)). Let \(T\) be an ideal extension of a semigroup \(S\) and \(\rho\subseteq T^1\times T^1\). The `generalized Cayley graph' \(\text{Cay}(S,\rho)\) of \(S\) relative to \(\rho\) is defined as the graph with vertex set \(S\) and edge set \(E(\text{Cay}(S,\rho))\) consisting of those ordered pairs \((a,b)\), where \(xay=b\) for some \((x,y)\in\rho\). The generalized Cayley graph \(\text{Cay}(S,\omega)\), where \(\omega=S^1\times S^1\) is called `universal Cayley graph of \(S\)'. Clearly, for \(\rho_1=T^1\times \{1\}\) and \(\rho_2=\{1\}\times T^1\), \(\text{Cay}(S,\rho_1)\) and \(\text{Cay}(S,\rho_2)\) are the classical definition of Cayley graph of semigroup defined by left and right transformations, respectively. After presenting some fundamental properties and general results about generalized Cayley graphs of semigroups, the author focuses on universal Cayley graphs and after introducing some notions, she describes the universal Cayley graph of a \(\mathcal J\)-partial order of complete graphs with loops. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Behnam Khosravi / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20M05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 20M20 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6031832 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
generalized Cayley graphs | |||
Property / zbMATH Keywords: generalized Cayley graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
simple semigroups | |||
Property / zbMATH Keywords: simple semigroups / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
ideal extensions | |||
Property / zbMATH Keywords: ideal extensions / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(\mathcal J\)-partial order of complete graphs with loops | |||
Property / zbMATH Keywords: \(\mathcal J\)-partial order of complete graphs with loops / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00233-011-9368-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4237762613 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4822425 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4846425 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4445976 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Cayley graphs of inverse semigroups. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4529513 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On transitive Cayley graphs of groups and semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A combinatorial property and Cayley graphs of semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5488153 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Directed graphs and combinatorial properties of semigroups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cayley graphs as classifiers for data mining: the influence of asymmetries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4661494 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On transitive Cayley graphs of strong semilattices of right (left) groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterizations of Clifford semigroup digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4484922 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2724086 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3950553 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(D\)-saturated property of the Cayley graphs of semigroups. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs of semigroups / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 04:42, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generalized Cayley graphs of semigroups. I. |
scientific article |
Statements
Generalized Cayley graphs of semigroups. I. (English)
0 references
8 May 2012
0 references
The study of Cayley graphs of semigroups and its valuable applications, is a very important research area which is closely related to finite state automata (see the survey by \textit{A. Kelarev, J. Ryan} and \textit{J. Yearwood}, [Discrete Math. 309, No. 17, 5360-5369 (2009; Zbl 1206.05050)] and Section 2.4 of the book by \textit{A. Kelarev}, [Graph algebras and automata. New York: Marcel Dekker (2003; Zbl 1070.68097)]). In this paper, the author first presents the following definition of generalized Cayley graphs of semigroups to unify the Cayley graphs of semigroups defined by right translations and left translations (note that the classical definition of Cayley graphs has no problem and the difference between the results about Cayley graphs defined by left and right actions, is because of the close relation between semigroups and these structures (similar to left and right \(S\)-acts)). Let \(T\) be an ideal extension of a semigroup \(S\) and \(\rho\subseteq T^1\times T^1\). The `generalized Cayley graph' \(\text{Cay}(S,\rho)\) of \(S\) relative to \(\rho\) is defined as the graph with vertex set \(S\) and edge set \(E(\text{Cay}(S,\rho))\) consisting of those ordered pairs \((a,b)\), where \(xay=b\) for some \((x,y)\in\rho\). The generalized Cayley graph \(\text{Cay}(S,\omega)\), where \(\omega=S^1\times S^1\) is called `universal Cayley graph of \(S\)'. Clearly, for \(\rho_1=T^1\times \{1\}\) and \(\rho_2=\{1\}\times T^1\), \(\text{Cay}(S,\rho_1)\) and \(\text{Cay}(S,\rho_2)\) are the classical definition of Cayley graph of semigroup defined by left and right transformations, respectively. After presenting some fundamental properties and general results about generalized Cayley graphs of semigroups, the author focuses on universal Cayley graphs and after introducing some notions, she describes the universal Cayley graph of a \(\mathcal J\)-partial order of complete graphs with loops.
0 references
generalized Cayley graphs
0 references
simple semigroups
0 references
ideal extensions
0 references
\(\mathcal J\)-partial order of complete graphs with loops
0 references