Results 61 to 70 of about 18,169 (133)
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
Sirkuit dan lintasan hamilton pada diagraph cayley [PDF]
, 2002 Sirkuit Hamilton pada digraph cayley adalah barisan garis berarah sedemikian sehingga setiap titik dari digraph cayley dilalui tepat satu kali, sebelum kembali ke titik awal.
Fatkhurrohman , Fatkhurrohman
core +1 more source
Path Hamilton pada Digraph Cayley
, 2014 This paper is a descriptive-qualitative research methods literature (library research) research that examines the literature, especially on digraph Cayley for the purpose of collecting data and information with the help of a variety of materials such ...
Br Sembiring, Metrilitna
core
Circulant digraph isomorphisms [PDF]
, 2016 We determine necessary and sufficient conditions for a Cayley digraph of the cyclic group of order n to have the property that any other Cayley digraph of a cyclic group of order n is isomorphic to the first if and only if an isomorphism between the two ...
Cancela, Elias Damian, Cancela, Elias
core
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
An algebraic model for inversion and deletion in bacterial genome rearrangement. [PDF]
J Math Biol, 2023 Clark C +3 more
europepmc +1 more source
The isomorphism problem for Cayley digraphs on groups of prime-squared order [PDF]
, 1995 Given any prime p, there are two non-isomorphic groups of order p2. We determine precisely when a Cayley digraph on one of these groups is isomorphic to a Cayley digraph on the other group.
Joseph, Anne
core +1 more source
Converting data into knowledge with RCA methodology improved for inverters fault analysis. [PDF]
Heliyon, 2022 Arias Velásquez RM, Mejía Lara JV.
europepmc +1 more source
The Covering Radius and a Discrete Surface Area for Non-Hollow Simplices. [PDF]
Discrete Comput Geom, 2022 Codenotti G, Santos F, Schymura M.
europepmc +1 more source