Results 101 to 110 of about 18,773 (121)

Connectivity of Cayley Digraphs

1996
The purpose of this chapter is to study several important mathematical problems related to the interconnection structure of networks. Thus the objects of our study are directed and undirected graphs. In many situations it is highly advantageous to use interconnection networks which are highly symmetric.
openaire   +1 more source

Onnectivities of minimal cayley coset digraphs

Applied Mathematics, 1996
The author proves that the connectivity of any minimal Cayley coset digraph coincides with its regular degree. He uses the concept of atoms introduced by \textit{M. E. Watkins} [J. Comb. Theory 8, 23-29 (1970; Zbl 0185.51702)], and, for directed graphs, is due to the reviewer [Combinatorics, Keszthely 1976, Colloq. Math. János Bolyai 18, 193-204 (1978;
openaire   +1 more source

On isomorpisms of Cayley digraphs on dihedral groups

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   +2 more sources

Automorphisms of groups and isomophisms of Cayley digraphs

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   +2 more sources

Isomorphisms and normality of Cayley digraphs of \(A_5\)

Australas. J Comb., 1999
A Cayley digraph \(X= \text{Cay}(G, S)\) is called normal if the right regular representation of \(G\) is a normal subgroup of \(\Aut(X)\). A subset \(S\) is said to be a CI-subset of \(G\), if for any graph isomorphism \(\text{Cay}(G,S)\cong \text{Cay}(G,T)\) there is an \(\alpha\in \Aut(G)\) such that \(S^\alpha= T\).
openaire   +2 more sources

On the automorphism groups of vertex-transitive Cayley digraphs of monoids

Journal of Algebraic Combinatorics, 2020
Bahman Khosravi, Behrooz Khosravi, Behnam Khosravi   +2 more
exaly  

On isomorphisms of Cayley digraphs on dicyclic groups

Australas. J Comb., 1997
Summary: We prove that for any \(m\in\{1,2,3\}\), the dicyclic group \(B_{4n}\) \((n\neq 2)\) is an \(m\)-DCI group if and only if \(n\) is odd.
openaire   +2 more sources

Cayley Digraphs Based on the de Bruijn Networks

SIAM Journal on Discrete Mathematics, 1998
O Serra
exaly  

The partition dimension of Cayley digraphs

Aequationes Mathematicae, 2006
Ortrud Oellermann
exaly  

Cayley Digraphs of Groups

2021
openaire   +1 more source