Results 11 to 20 of about 18,773 (121)
Discrete Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Josep M. Brunat +3 more
openaire +2 more sources
Study of Cayley Digraphs over Polygroups
MathematicsIn this paper we introduce Cayley digraphs associated to finitely generated polygroups, where the vertices correspond to finite products of the generators of polygroups and the edges to multiplication by vertices and generators.
Ali Sanjabi +4 more
doaj +2 more sources
Large butterfly Cayley graphs and digraphs [PDF]
Discrete Mathematics, 2017 We present families of large undirected and directed Cayley graphs whose construction is related to butterfly networks. One approach yields, for every large $k$ and for values of $d$ taken from a large interval, the largest known Cayley graphs and digraphs of diameter $k$ and degree $d$.
Bevan, David
core +11 more sources
On endo-Cayley digraphs: The hamiltonian property [PDF]
Discrete Mathematics, 2005 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
core +4 more sources
On isomorphisms of m-Cayley digraphs [PDF]
The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In this paper, we consider this problem for $m$-Cayley digraphs which are generalization of Cayley digraphs. Let $m$ be a positive integer.
Xing Zhang +3 more
core +4 more sources
Enumeration of Cayley graphs and digraphs [PDF]
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brian Alspach, Marni Mishna
openaire +3 more sources
The connectivity of hierarchical Cayley digraphs [PDF]
Discrete Applied Mathematics, 1992 Let \(S\) be a set of generators of a group \(G\). \(S\) is said to be hierarchical if there exists an ordering of \(S\) such that the subgroup \(S_ i\) generated by the first \(i\) elements of the ordering is a proper subgroup of \(S_{i+1}\). If \(S\) is hierarchical and \(S\subseteq\overline S\subseteq S\cup S^{-1}\) then the Cayley digraph on \(G ...
Yahya Ould Hamidoune +2 more
openaire +4 more sources
On the Connectivity of Cayley Digraphs [PDF]
European Journal of Combinatorics, 1984 L'auteur rappelle la définition et les propriétés des atomes et des fragments d'un digraphe. Il montre que l'atome d'un digraphe de Cayley qui contient l'unité est un sous-groupe et en déduit une courte preuve d'un résultat de Imrich. Il prouve que la connectivité d'un digraphe de Cayley ayant un ensemble minimal de générateurs est optimale ...
Hamidoune, Yahya Ould
openaire +4 more sources
Cayley Digraphs from Complete Generalized Cycles [PDF]
European Journal of Combinatorics, 1999 The complete generalized cycle \(G(d,n)\) is the digraph whose vertex set is \(Z_n \times Z_d\) and whose edges are all pairs \(((i,x),(i+1,y))\), where \(i \in Z_n\) and \(x,y \in Z_d\). For any integer \(k \geq 1\), we define \(G(d,n,k) = LG(d,n,k-1)\) (here, \(LG\) denotes the line graph of \(G\)), with \(G(d,n,1)=G(d,n)\).
Josep M. Brunat +3 more
openaire +4 more sources
On the path homology of Cayley digraphs and covering digraphs [PDF]
Journal of AlgebraWe develop a theory of covering digraphs, similar to the theory of covering spaces. By applying this theory to Cayley digraphs, we build a "bridge" between GLMY-theory and group homology theory, which helps to reduce path homology calculations to group homology computations.
Shaobo Di +3 more
core +4 more sources