Generalized Moore graphs are regular graphs that satisfy an additional distance condition, namely, that there be the maximum number of vertices as close as possible to any particular vertex, when that vertex is considered as root vertex. These graphs form a useful model for the study of various theoretical properties of computer communications networks. In particular, they lend themselves to a discussion of lower bounds for network cost, delay, reliability, and vulnerability. A considerable number of papers have already been published concerning the existence and properties of generalized Moore graphs of valence three, and some initial studies have discussed generalized Moore graphs of valence four, when the number of vertices is less than fourteen. This paper continues the previous studies for those cases when the graph contains a number of vertices that is between fourteen and twenty. In the case of valence three, the graph with a complete second level exists; it is just the Petersen graph. The situation is quite different for valence four; not only does the graph with a complete second level not exist, but the graphs in its immediate “neighbourhood” also fail to exist.

In this paper, we investigate the existence of skew frames with sets of skew transversals. We consider skew frames of type \(1^n\) and skew frames of type \((2^m)^q\) with sets of skew transversals. These frames are equivalent to three-dimensional frames which have complementary \(2\)-dimensional projections with special properties.

All graphs meeting the basic necessary conditions to be the leave graph of a maximal partial triple system with at most thirteen elements are generated. A hill-climbing algorithm is developed to determine which of these candidates are in fact leave graphs. Improved necessary conditions for a graph to be a leave graph are developed.

Some new lower bounds for higher Ramsey numbers are presented. Results concerning generalized hypergraph Ramsey numbers are also given.

We enumerate the perfect one-factorizations of \(K_{50}\), which are generated by starters in \({Z}_{49}\), fixed by multiplication by \(18\) and \(30\). There are precisely \(67\) non-isomorphic examples.

Let the vertices of a graph denote computer processes which communicate by passing messages along edges. It has been a standard Computer Science problem to provide algorithms that let the processes solve problems jointly (e.g. leader election, clock synchronization). What if some of the processes are maliciously faulty, i.e. send messages calculated to sabotage joint algorithms? Here we review a few “byzantine agreement” algorithms with interesting graph-theoretic features and raise questions about graph connectivity and diameter (with a few answers).

Let the vertices of a graph denote processes in a distributed or time-shared computer system; let two vertices be connected by an edge if the two processes cannot proceed at the same time (they mutually exclude one another). Managing mutual exclusion and related scheduling problems has given rise to substantial literature in computer science. Some methods of attack include covering or partitioning the graph with cliques or threshold graphs. Here I survey some recent graph-theoretic results and examples motivated by this approach.