61 research outputs found
Large butterfly Cayley graphs and digraphs
We present families of large undirected and directed Cayley graphs whose
construction is related to butterfly networks. One approach yields, for every
large and for values of taken from a large interval, the largest known
Cayley graphs and digraphs of diameter and degree . Another method
yields, for sufficiently large and infinitely many values of , Cayley
graphs and digraphs of diameter and degree whose order is exponentially
larger in than any previously constructed. In the directed case, these are
within a linear factor in of the Moore bound.Comment: 7 page
Degree/diameter problem for mixed graphs
The Degree/diameter problem asks for the largest graphs given diameter and maximum degree. This problem has been extensively studied both for directed and undirected graphs, ando also for special classes of graphs. In this work we present the state of art of the degree/diameter problem for mixed graphs
Further topics in connectivity
Continuing the study of connectivity, initiated in §4.1 of the Handbook, we survey here some (sufficient) conditions under which a graph or digraph has a given connectivity or edge-connectivity. First, we describe results concerning maximal (vertex- or edge-) connectivity. Next, we deal with conditions for having (usually lower) bounds for the connectivity parameters. Finally, some other general connectivity measures, such as one instance of the so-called “conditional connectivity,” are considered.
For unexplained terminology concerning connectivity, see §4.1.Peer ReviewedPostprint (published version
Algebraic and Computer-based Methods in the Undirected Degree/diameter Problem - a Brief Survey
This paper discusses the most popular algebraic techniques and computational methods that have been used to construct large graphs with given degree and diameter
- …