Results 1 to 10 of about 18,773 (121)
Automorphism groups and isomorphisms of Cayley digraphs [PDF]
Let \(G\) be a finite group and \(S\) a subset of \(G\), not containing the identity element 1. The Cayley digraph \(X=\text{Cay} (G,S)\) is defined by \(V(X)=G\) and \(E(X)=\{(g,sg)\;|\;g\in G,\;s\in S\}\). A subset \(S\) of \(G\) is called a CI-subset of \(G\), if for any subset \(T\) of \(G\) with \(\text{Cay} (G,S)\) isomorphic to \(\text{Cay} (G,T)
Ming-Yao Xu
exaly +4 more sources
Which Faber–Moore–Chen digraphs are Cayley digraphs? [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maria Ždímalová
exaly +5 more sources
Structural properties and isomorphism theorems for Cayley digraphs of full transformation semigroups with respect to Green's equivalence classes [PDF]
Let T(X) be the full transformation semigroup on a nonempty set X. In this paper, the Cayley digraphs of T(X) with connection sets L and R, the Green's equivalence classes of T(X) according to the Green's relations L and R, are investigated. Furthermore,
Nuttawoot Nupo, Yanisa Chaiya
doaj +2 more sources
Divisible design Cayley digraphs [PDF]
Divisible design digraphs which can be obtained as Cayley digraphs are studied. A characterization of divisible design Cayley digraphs in terms of the generating sets is given. Further, we give several constructions of divisible design Cayley digraphs and classify divisible design Cayley digraphs on $v \le 27$ vertices.
Andrea Svob +2 more
exaly +3 more sources
Large Cayley digraphs and bipartite Cayley digraphs of odd diameters
16 pages, Published in Discrete Mathematics.
Tomáš Vetrík, Marcel Abas
exaly +4 more sources
The metric dimension of Cayley digraphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ortrud Oellermann
exaly +3 more sources
Random Cayley digraphs of diameter 2 and given degree [PDF]
Graph ...
Manuel E. Lladser +3 more
doaj +2 more sources
Cayley Digraphs Associated to Arithmetic Groups [PDF]
We explore a paradigm which ties together seemingly disparate areas in number theory, additive combinatorics, and geometric combinatorics including the classical Waring problem, the Furstenberg-Sárközy theorem on squares in sets of integers with positive density, and the study of triangles (also called $2$-simplices) in finite fields.
Jonathan Pakianathan, David Covert
exaly +5 more sources
Action graph of a semigroup act & its functorial connection [PDF]
In this paper we define C-induced action graph G(S,a,C;A) corresponding to a semigroup act (S,a,A) and a subset C of S. This generalizes many interesting graphs including Cayley Graph of groups and semigroups, Transformation Graphs (TRAG), Group Action ...
Promit Mukherjee +2 more
doaj +1 more source
On the Independence Number of Cayley Digraphs of Clifford Semigroups
Let S be a Clifford semigroup and A a subset of S. We write Cay(S,A) for the Cayley digraph of a Clifford semigroup S relative to A. The (weak, path, weak path) independence number of a graph is the maximum cardinality of an (weakly, path, weakly path ...
Krittawit Limkul, Sayan Panma
doaj +1 more source

