Results 101 to 110 of about 18,169 (133)

On the Cayley digraphs that are patterns of unitary matrices

, 2003
This is a short note on some properties of a family of Cayley digraphs. A digraph D is the pattern of a matrix M when D has an arc ij if and only if the ij-th entry of M is nonzero.
Simone, Severini
core  

Red-capped parrakeet (Purpureicephalus spurius) [picture] /

, 1930
Title from inscription on mount.; Inscriptions: "N.W. Cayley" --Signed lower right.; Also available online at: http://nla.gov.au/nla.pic-an6952741; R10109 ...
Cayley, Neville W. (Neville William), 1886-1950.
core  

A systematic approach to classifying and evaluating heterogeneity measures. [PDF]

R Soc Open Sci
Ottow R.
europepmc   +1 more source

Context-free pairs of groups II - Cuts, tree sets, and random walks.

Discrete Math, 2012
Woess W.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A Family of Nonnormal Cayley Digraphs

Acta Mathematica Sinica, English Series, 2001
Let \(G\) be a finite group and \(S\) a generating set of \(G\). The Cayley digraph \(\Gamma=\text{Cay}(G,S)\) is defined by taking \(G\) as set of vertices and the pairs \((g,sg)\), with \(g\in G\) and \(s\in S\), as arcs. The right regular representation \(G_R\) of \(G\) is a subgroup of \(\Aut(\Gamma)\), the automorphisms group of \(\Gamma\).
Feng, Yan Quan, Wang, Dian Jun, Chen, Jing Lin   +2 more
exaly   +3 more sources

A Note on Moore Cayley Digraphs

Graphs and Combinatorics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander L. Gavrilyuk, Mitsugu Hirasaka, Vladislav V. Kabanov   +2 more
openaire   +1 more source

Vosperian and superconnected Abelian Cayley digraphs

Graphs and Combinatorics, 1991
A digraph is Vosperian if any fragment has cardinality one or \(| V(X)|-d^ +(X)-1\). A digraph is superconnected if every minimum cutset is the set of vertices adjacent from or to some vertex. The authors use a result of \textit{J. H. B. Kemperman} [Acta Math.
Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra   +2 more
openaire   +2 more sources

On Isomorphisms of Minimal Cayley Graphs and Digraphs

Graphs and Combinatorics, 2001
A Cayley graph or Caylay digraph \(\text{Cay}(G,S)\) is called a CI-graph of the group \(G\) if, for any \(T\subseteq G\), \(\text{Cay}(G,S)\cong \text{Cay}(G,T)\) iff \(S^\sigma= T\) for some \(\sigma\in \text{Aut}(G)\). The aim of the paper is to characterize finite abelian groups for which all minimal Cayley graphs and Cayley digraphs are CI-graphs.
Cai Heng Li, Sanming Zhou
openaire   +3 more sources

Isomorphisms of Connected Cayley Digraphs

Graphs and Combinatorics, 1998
A Cayley graph \(X(G;S)\) on a finite group \(G\) is said to be a CI-graph if for any \(T\subset G\), \(S=\alpha(T)\) for some \(\alpha\in \Aut(G)\) only when \(X(G;S)\cong X(G;T)\). The author investigates minimal Cayley graphs on abelian groups with respect to being CI-graphs, and isomorphisms of connected Cayley graphs on groups which are abelian ...
openaire   +2 more sources

Recognizing Cayley Digraphs

Mathematics Magazine, 2020
A criterion is developed that decides in a finite number of steps whether a finite digraph is a Cayley digraph of some group.
openaire   +1 more source