Characterisation of some sparse binary sequential arrays.
Characterisation of Some Steiner Systems, Parallelisms, and Biplanes.
Characterizations of transversal and fundamental transversal matroids.
Chohomological Aspects of Two-Graphs.
Chromatic Number And The Spectrum Of A Graph
Circle-packing connections with random walks and a finite volume method
Circuit and cocircuit partitions of binary matroids
We give an example of a class of binary matroids with a cocircuit partition and we give some characteristics of a set of cocircuits of such binary matroids which forms a partition of the ground set.
Circulants and the chromatic index of Steiner triple systems
Classification of flocks of the quadratic cone over fields of order at most 29.
Classification of generalized Hadamard matrices and quaternary Hermitian self-dual codes of length 18.
Classification of Maximal Optical Orthogonal Codes of Weight 3 and Small Lengths
Dedicated to the memory of the late professor Stefan Dodunekov on the occasion of his 70th anniversary. We classify up to multiplier equivalence maximal (v, 3, 1) optical orthogonal codes (OOCs) with v ≤ 61 and maximal (v, 3, 2, 1) OOCs with v ≤ 99. There is a one-to-one correspondence between maximal (v, 3, 1) OOCs, maximal cyclic binary constant weight codes of weight 3 and minimum dis tance 4, (v, 3; ⌊(v − 1)/6⌋) difference packings, and maximal (v, 3, 1) binary cyclically permutable constant...
Classification of the Steiner quadruple systems of cardinality 32
Class-uniformly resolvable group divisible structures. I: Resolvable group divisible designs.
Class-uniformly resolvable group divisible structures. II: Frames.
Cliques and Claws in Edge-transitive Strongly Regular Graphs.
Closure conditions of commutativity
There are investigated some closure conditions of Thomsen type in 3-webs which gurantee that at least one of coordinatizing quasigroups of a given 3-web is commutative.
Coalescing Fiedler and core vertices
The nullity of a graph is the multiplicity of zero as an eigenvalue in the spectrum of its adjacency matrix. From the interlacing theorem, derived from Cauchy’s inequalities for matrices, a vertex of a graph can be a core vertex if, on deleting the vertex, the nullity decreases, or a Fiedler vertex, otherwise. We adopt a graph theoretical approach to determine conditions required for the identification of a pair of prescribed types of root vertices of two graphs to form a cut-vertex of unique...
Codes, lattices, and Steiner systems.
Coherent configurations I
Collineations and Extensions of Translation Nets.