Results 11 to 20 of about 1,092 (193)
Canadian Mathematical BulletinAbstractA digraph group is a group defined by non-empty presentation with the property that each relator is of the form $R(x, y)$ , where x and y are distinct generators and $R(\cdot , \cdot )$ is determined by some fixed cyclically reduced word $R(a, b)$ that involves both a and b.
Mehmet Sefa Cihan, Gerald Williams
openaire +5 more sources
The group of autotopies of a digraph [PDF]
Czechoslovak Mathematical Journal, 1971 summary:All crossed products of two cyclic groups are explicitly described using generators and relations.
Dragoş Frăţilă +4 more
openaire +2 more sources
The Automorphism Groups of Minimal Infinite Circulant Digraphs
European Journal of Combinatorics, 1997 Given a group \(G\), a directed graph \(X\) is called a digraph regular representation (DRR) of \(G\) if Aut\((X)\simeq G\) (as abstract groups) and the action of Aut\((X)\) on \(V(X)\) is that of a regular permutation group. It is well known that in this case \(X\) must be a Cayley digraph \(X(G,S)\) where \(S\subset G\) and \(\langle S\rangle=G ...
Jixiang Meng, Qiongxiang Huang
openaire +2 more sources
On Haar digraphical representations of groups [PDF]
Discrete Mathematics, 2020 8 ...
Du J. -L., Feng Y. -Q., Spiga P.
openaire +2 more sources
On n-partite digraphical representations of finite groups [PDF]
Journal of Combinatorial Theory, Series A, 2022 9 ...
Du J. -L., Feng Y. -Q., Spiga P.
openaire +2 more sources
Automorphism Groups of Wreath Product Digraphs [PDF]
The Electronic Journal of Combinatorics, 2009 We generalize a classical result of Sabidussi that was improved by Hemminger, to the case of directed color graphs. The original results give a necessary and sufficient condition on two graphs, $C$ and $D$, for the automorphsim group of the wreath product of the graphs, ${\rm Aut}(C\wr D)$ to be the wreath product of the automorphism groups ${\rm Aut}(
Dobson, Edward, Morris, Joy
openaire +3 more sources
Realization of digraphs in Abelian groups and its consequences [PDF]
Journal of Graph Theory, 2021 AbstractLet be a directed graph of order with no component of order less than 3, and let be a finite Abelian group such that or if is large enough with respect to an arbitrarily fixed then . We show that there exists an injective mapping from to the group such that for every connected component of , where 0 is the identity element of ...
Sylwia Cichacz, Zsolt Tuza
openaire +3 more sources
Cayley Digraphs Associated to Arithmetic Groups [PDF]
Graphs and Combinatorics, 2019 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.
David Covert +2 more
openaire +3 more sources
BENTUK CAYLEY COLOR DIGRAPH GRUP SIKLIK G DENGAN ORDER n [PDF]
, 2022 Let G be a cyclic group with set of generators . Let G with color xi is a digraph with vertices elements of and there is an arrow from to if . In this artcle, we find the Cayley color digraph of a cylic group of order .
Agung, Mohammad +2 more
core +1 more source
Digraph Competitions and Cooperative Games [PDF]
, 2002 Digraph competition, cooperative TU-game, Shapley value, core, marginal vector, selectope vector, simple score vector,
Borm, P.E.M. +6 more
core +1 more source