Results 1 to 10 of about 18,169 (133)
On endo-Cayley digraphs: The hamiltonian property [PDF]
Let \(A\) be a finite abelian group, \(\Delta\subseteq A\), and \(\varphi\) an endomorphism of \(A\). A digraph whose vertices are the elements of \(A\) and whose arcs are the pairs \((x,\varphi(x)+a)\) with \(x\in A\) and \(a\in A\) is called an endo-Cayley digraph. In this paper Hamiltonicity properties of endo-Cayley digraphs are investigated.
Montserrat Maureso, Josep M Brunat
exaly +3 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
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 ...
Sayan Panma, Krittawit Limkul
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
Normality of 2-Cayley digraphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bijan Taeri, Majid Arezoomand
exaly +2 more sources
Automorphism groups and isomorphisms of Cayley digraphs
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 +3 more sources
Cayley digraphs with normal adjacency matrices
Let \(G\) be a finite group and \(S\) a subset of \(G\) which does not contain the identity element. The Cayley digraph \(D(G,S)\) is the digraph with \(G\) as vertex set and \(\{(g, sg): g\in G,\;s\in S\}\) as arc-set. The digraph \(D(G,S)\) is regular of degree the cardinality of \(S\).
David S. Lyubshin, Sergey V. Savchenko
exaly +2 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
Moore mixed graphs from Cayley graphs
A Moore (r, z, k)-mixed graph G has every vertex with undirected degree r, directed in- and out-degree z, diameter k, and number of vertices (or order) attaining the corresponding Moore bound M(r, z, k) for mixed graphs. When the order of G is close to M(
Cristina Dalfo, Miquel Àngel Fiol
doaj +1 more source

