We construct a family of Cayley digraphs of degree d, diameter k and order k⌊ d/2⌋ k for any
d≥ 4 and k≥ 3. We also present a collection of bipartite Cayley digraphs of order at least …

A perfect directed code (or an efficient twin domination) of a digraph is a vertex subset where
every other vertex in the digraph has a unique in-and a unique out-neighbor in the subset. In …

Let C d, k be the largest number of vertices in a Cayley digraph of degree d and diameter k,
and let BC d, k be the largest order of a bipartite Cayley digraph for given d and k. For every …

In this paper we focus our attention on multi-dimensional copula models of returns of the
indexes of selected prominent international financial markets. Our modeling results, based …

Open Research Online oro.open.ac.uk Page 1 Open Research Online The Open University’s
repository of research publications and other research outputs Extremal Metric and Topological …

We show that the large Cayley digraphs of certain given out-degree and diameter resulting
from a construction of Faber, Moore and Chen (1993) can be obtained directly from the …

One of the prominent areas of research in graph theory is the degree-diameter problem, in
which we seek to determine how many vertices a graph may have when constrained to a …

Abstract In 1995, Comellas and Fiol proposed a construction of record large vertex-transitive
digraphs of given degree and diameter out of relatively small vertex-transitive input …