
An affine (respectively projective) failed design
In
A construction of rectangular designs from Bhaskar Rao designs is described. As special cases some series of rectangular designs are obtained.
A graph
A
A
These results generalize the theorems due to W. D. Wallis, A. I. W. Hilton and C. Q. Zhang.
It is shown that the integrity of the
We discuss the learning problem in a two-layer neural network. The problem is reduced to a system of linear inequalities, and the solvability of the system is discussed.
We show how to generate
For any integers
An
Lee conjectures that for any
A balanced incomplete block design
We exhibit here an infinite family of planar bipartite graphs which admit a
It is shown that under certain conditions, the embeddings of chessboards in square boards, yield non-isomorphic associated graphs which have the same chro- matic polynomials. In some cases, sets of non-isomorphic graphs with this property are formed.
A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. In this paper we give some constructions of pairwise orthogonal diagonal Latin squares (PODLS). As an application of such constructions we improve the known result about three PODLS and show that there exist three PODLS of order
Finding the probability that there is an operational path between two designated vertices in a probabilistic computer network is known to be NP-hard. Edge-packing is an efficient strategy to compute a lower bound on the probability. We prove that finding the set of paths that produces the best edge-packing lower bound is NP-hard.
Using a contraction method, we find some best-possible sufficient conditions for
We examine the problem of finding longest cycles in inner triangulations, that is,
A dominating set in a graph
The translation planes of order 16 have been classified by Dempwolff and Reifart
The problem we consider is: Given a complete multipartite graph
The maximum edge-weighted clique problem in complete multipartite graphs arises in transit scheduling, where it is called the schedule synchronization problem.
We describe an algorithm which combines a discrete optimization heuristic with the construction due to Ringel and Sachs (independently) for self-complementary graphs. The algorithm is applied to some problems from Generalized Ramsey Theory.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.