
We consider a pair of MOLS (mutually orthogonal Latin squares) having holes, corresponding to missing sub-MOLS, which are disjoint and spanning. If the two squares are mutual transposes, we say that we have SOLS (self-orthogonal Latin squares) with holes. It is shown that a pair of SOLS with $n$ holes of size
As an application, we prove a result concerning intersection numbers of transversal designs with four groups.
We survey here results and problems from the reconstruction theory of evolutionary trees, which involve enumeration and inversion.
It is proved in this paper that for any integer
In this note, we construct a
In this paper, we prove the NP-hardness of the bottleneck graph bipartition problem and study the complexity status of possible approximation algorithms for some related problems.
This paper concerns neighbour designs in which the elements of each block are arranged on the circumference of a circle. Most of the designs considered comprise a general class of balanced Ouchterlony neighbour designs, which include the balanced circuit designs of Rosa and Huang
A dependence system on a set
Let
We introduce a complex version of Golay sequences and show how these may be applied to obtain new Hadamard matrices and complex Hadamard matrices. We also show how to modify the Goethals-Seidel array so that it can be used with complex sequences.
In this paper, we improve the best known algorithm on symmetric equivalence of Hadamard matrices by considering the eigenvalues of symmetric Hadamard matrices. As a byproduct, the eigenvalues of skew Hadamard matrices are also discussed.
The spectrum for
An efficient dominating set
Numbers similar to the van der Waerden numbers
For any graph
The basic interpolation theorem states that if graph
We find the set of integers
In this paper, we consider some combinatorial structures called balanced arrays (
We present efficient algorithms for computing the matching polynomial and chromatic polynomial of a series-parallel graph in
Our techniques for computing the graph polynomials can be applied to certain other graph polynomials and other classes of graphs as well. Furthermore, our algorithms can also be parallelized into NC algorithms.
Given positive integers
In this paper, we study the structure of
Furthermore, for each
1970-2025 CP (Manitoba, Canada) unless otherwise stated.