Results 151 to 160 of about 1,092 (193)

Retinal waves in adaptive rewiring networks orchestrate convergence and divergence in the visual system. [PDF]

Netw Neurosci
Luna R, Li J, Bauer R, van Leeuwen C.
europepmc   +1 more source

Modeling security evaluation framework for IoHT-driven systems using integrated decision-making methodology. [PDF]

Sci Rep
Khan HU, Ali Y.
europepmc   +1 more source

Direct product of automorphism groups of digraphs

, 2017
openaire   +2 more sources

Two‐sided Group Digraphs and Graphs

Journal of Graph Theory, 2015
AbstractWe study a family of digraphs (directed graphs) that generalises the class of Cayley digraphs. For nonempty subsets of a group G, we define the two‐sided group digraph to have vertex set G, and an arc from x to y if and only if for some and . In common with Cayley graphs and digraphs, two‐sided group digraphs may be useful to model networks
Moharram N. Iradmusa, Cheryl E. Praeger
openaire   +1 more source

AUTOMORPHISM GROUPS OF BICOSET DIGRAPHS

Bulletin of the Australian Mathematical Society
AbstractWe examine bicoset digraphs and their natural properties from the point of view of symmetry. We then consider connected bicoset digraphs that are X-joins with collections of empty graphs, and show that their automorphism groups can be obtained from their natural irreducible quotients.
RACHEL BARBER, TED DOBSON, GREGORY ROBSON   +2 more
openaire   +1 more source

On Cayley digraphs on nonisomorphic 2‐groups

Journal of Graph Theory, 2011
AbstractA necessary and sufficient condition is given for two Cayley digraphs X1 = Cay(G1, S1) and X2 = Cay(G2, S2) to be isomorphic, where the groups Gi are nonisomorphic abelian 2‐groups, and the digraphs Xi have a regular cyclic group of automorphisms. Our result extends that of Morris [J Graph Theory 3 (1999), 345–362] concerning p‐groups Gi, where
István Kovács, Mary Servatius
openaire   +1 more source

Automorphisms of groups and isomophisms of Cayley digraphs [PDF]

Australas. J Comb., 1995
Let \(G\) be a finite group and \(S\) a subset of \(G\) with \(1\not\in S\). \(D= D(G, S)\) denotes the Cayley digraph of \(G\) with respect to \(S\). Set \(\text{ST}(G, S)= \{\sigma\in \Aut[D(G, S)]\mid \sigma(1)= 1\}\), \(\Aut(G, S)= \{\sigma\in \Aut G\mid \sigma(S)= S\}\), and let \(I\) be the identity permutation on \(G\).
Jixiang Meng, Mingyao Xu
openaire   +1 more source

Extremal Cayley Digraphs of Finite Abelian Groups

2011 14th IEEE International Conference on Computational Science and Engineering, 2011
Cayley graphs of finite abelian groups are often used to model communication networks. Because of their applications, extremal Cayley digraphs have been studied extensively in recent years. Given any positive integers d and k. Let m∗(d, k) denote the largest positive integer m such that there exists an m-element finite abelian group Γ and a kelement ...
Abby Gail Mask, Joni Schneider, Xingde Jia   +2 more
openaire   +2 more sources

On isomorpisms of Cayley digraphs on dihedral groups [PDF]

Australas. J Comb., 1997
Let \(G\) be a finite group and \(S\) a subset of \(G\) not containing the identity element 1. The Cayley digraph \(\Gamma=\text{Cay}(G, S)\) is defined by \(V(\Gamma)= G\) and \(E(\Gamma)= \{(g,sg)\mid g\in G, s\in S\}\). A subset \(S\) of \(G\) is called a CI-subset of \(G\), if for any subset \(T\) of \(G\) with \(\text{Cay}(G, S)\) isomorphic to \(\
Haipeng Qu, Jinsong Yu
openaire   +1 more source