Results 11 to 20 of about 18,169 (133)
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Josep M. Brunat +3 more
openaire +2 more sources
When the arc-colored line digraph of a cayley colored digraph is again a cayley colored digraph [PDF]
Let D6(G) be the Cayley colored ügraph of a finite group G generated by A. The arc-colored line digraph of a Cayley colored digraph ie obtained by appropriately coloring the arcs of its line digraph. In this paper it is shown that the group of automorphisms of D6 (G) that act as permutations on the color classes is isomorphic to the gemidirect product ...
Fiol Mora, Maria Lluïsa +2 more
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
Cayley Digraphs from Complete Generalized Cycles [PDF]
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
Dihedral butterfly digraph and its Cayley graph representation [PDF]
In this paper, we present a new extension of the butterfly digraph, which is known as one of the topologies used for interconnection networks. The butterfly digraph was previously generalized from binary to d-ary.
Tanaka, Yuuki +6 more
core +3 more sources
Asymptotic enumeration of graphical regular representations
Abstract We estimate the number of graphical regular representations (GRRs) of a given group with large enough order. As a consequence, we show that almost all finite Cayley graphs have full automorphism groups ‘as small as possible’. This confirms a conjecture of Babai–Godsil–Imrich–Lovász on the proportion of GRRs, as well as a conjecture of Xu on ...
Binzhou Xia, Shasha Zheng
wiley +1 more source
Minimal‐time complex consensus for multi‐agent systems with time delay
Abstract This paper studies the minimum time consensus problem for discrete‐time multi‐agent systems with complex Laplacian delay networks such that each agent can find its complex consensus value in a minimum number of steps using its local observations.
Chao Zou, Li Yu, Simon Yang, Linlin Ou
wiley +1 more source
BENTUK CAYLEY COLOR DIGRAPH GRUP SIKLIK G DENGAN ORDER n [PDF]
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
Certain Concepts in Vague Graph with an Application
Vague graphs (VGs), belonging to the FGs family, have good capabilities when faced with problems that cannot be expressed by FGs. When an element’s membership is not clear, neutrality is a good option that can be well‐supported by a VG. The previous definition limitations in irregular‐FG have led us to offer new definitions in VGs.
Xiaolong Shi +4 more
wiley +1 more source
Mobius Group Generated by Two Elements of Order 2, 4, and Reduced Quadratic Irrational Numbers
The construction of circuits for the evolution of orbits and reduced quadratic irrational numbers under the action of Mobius groups have many applications like in construction of substitution box (s‐box), strong‐substitution box (s.s‐box), image processing, data encryption, in interest for security experts, and other fields of sciences.
Dilshad Alghazzawi +5 more
wiley +1 more source

