
If
We construct a complex
Colbourn introduced
A weighted graph
For this natural generalization of the well-known domination number, we study some of the classical questions of domination theory. We characterize all extremal graphs for the simple Ore-like bound
Generalized Steiner systems GS
An
We prove that
A
In this paper, we derive an inequality on the existence of bi-level balanced arrays (B-arrays) of strength eight by using a result involving central moments from statistics, and by counting in two ways the number of coincidences of various columns with a specific column. We discuss the use of this inequality in obtaining the maximum number of constraints for these arrays, and present some illustrative examples.
In this note, we present many uniquely
An
A union closed (UC) family
An FC family is a UC family
The vertices
Let G be a simple connected graph on 2n vertices with a perfect matching. For a positive integer k,
Let
A graph
For a graph
We examine a query posed as a conjecture by Key and Moori [11, Section 7] concerning the full automorphism groups of designs and codes arising from primitive permutation representations of finite simple groups, and based on results for the Janko groups
1970-2025 CP (Manitoba, Canada) unless otherwise stated.