Results 61 to 70 of about 18,773 (121)
Random Cayley Digraphs and the Discrete Logarithm [PDF]
, 2002 We formally showthat there is an algorithm for dlog over all abelian groups that runs in expected optimal time (up to logarithmic factors) and uses only a small amount of space. To our knowledge, this is the first such analysis. Our algorithm is a modification of the classic Pollard rho, introducing explicit randomization of the parameters for the ...
Jeremy Horwitz, Ramarathnam Venkatesan
openaire +1 more source
The dilating method to obtain dense cayley digraphs on finite abelian groups [PDF]
, 2021 A geometric method for obtaining an infinite family of Cayley digraphs of constant density on finite abelian groups is presented. The method works for any given degree d ≥ 2, and it is based on consecutive dilates of a minimum distance diagram associated
Pérez Mansilla, Sonia +2 more
core +3 more sources
ON THE NORMALITY OF SOME CAYLEY DIGRAPHS WITH VALENCY 2 [PDF]
, 2011 We call a Cayley digraph =Cay(G; S) normal for G if R(G), the rightregular representation of G, is a normal subgroup of the full automorphism groupAut() of .
Mehdi Alaeiyan
core +1 more source
Algebraic degrees of $n$-Cayley digraphs over abelian groups [PDF]
A digraph is called an $n$-Cayley digraph if its automorphism group has an $n$-orbit semiregular subgroup. We determine the splitting fields of $n$-Cayley digraphs over abelian groups and compute a bound on their algebraic degrees, before applying our ...
Liu, Xiaogang, Li, Hao
core +1 more source
Isomorphisms of Finite Cayley Digraphs of Bounded Valency, II [PDF]
, 1999 For a finite group G and a subset S of G which does not contain the identity of G, denote by Cay(G, S) the Cayley digraph of G with respect to S. An automorphism σ of the group G induces a graph isomorphism from Cay(G, S) to Cay(G, Sσ). In this paper, we
Li, Cai Heng, Cai Heng Li
core +1 more source
On the primitivity of Cayley digraphs
Linear Algebra and its Applications, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Isomorphisms of Cayley digraphs of Abelian groups [PDF]
Bulletin of the Australian Mathematical Society, 1998 For a finite group G and a subset S of G with 1 ∉ S, the Cayley graph Cay(G, S) is the digraph with vertex set G such that (x, y) is an arc if and only if yx−1 ∈ S. The Cayley graph Cay(G, S) is called a CI-graph if, for any T ⊂ G, whenever Cay (G, S) ≅ Cay(G, T) there is an element a σ ∈ Aut(G) such that Sσ = T.
openaire +2 more sources
Metric and fault-tolerant metric dimension for GeSbTe superlattice chemical structure. [PDF]
PLoS One, 2023 Liqin L +4 more
europepmc +1 more source
Digraphs on permutations [PDF]
, 1997 We study a family of vertex transitive digraphs whose vertices represent the k-permutations of n elements. After showing some general properties, we concentrate upon the study of the symmetry of these digraphs.
Fiol, M.L., Fiol, M.A., Brunat, J.M.
core +1 more source
European Journal of Applied SciencesIn this paper, a new class of digraphs, namely, Cayley coset digraphs associated with a group , a subgroup and a subset of is introduced and it is shown that it is vertex transitive. Further the conditions under which this digraph is connected, complete and has loops and parallel edges are obtained.
Sujatha Suram, Madhavi Levaku
openaire +1 more source