-
Article
Simple Minimum (K4 − e)-coverings of Complete Multipartite Graphs
A decomposition of Kn(g) ∪ Γ, the complete n-partite equipartite graph over gn vertices union a graph Γ (called the excess) that is a subgraph of Kn(g), into edge disjoint copies of a graph G is called a simple m...
-
Article
Maximum two-dimensional (u × v, 4, 1, 3)-OOCs
Let Φ(u × v, k, λ a , λ c ) be the largest possible number of codewords among all two-dimensional (u × v, k, λ
-
Article
The fine triangle intersections for maximum kite packings
In this paper, the fine triangle intersection problem for a pair of maximum kite packings is investigated. Let Fin(v) = {(s, t): ∃ a pair of maximum kite packings of order v intersecting in s blocks and s + t tri...
-
Article
On the covering number c λ(3,W 4 (3) , v)
A t-hyperwheel (t ≥ 3) of length l (or W l (t) for brevity) is...
-
Article
The fine structures of three symmetric Latin squares with even orders
Denote by SFin(v) the set of all integer pairs (t, s) for which there exist three symmetric Latin squares of order v on the same set having fine structure (t, s). We completely determine the set SFin(2n) for any ...
-
Article
The spectrum of (gυ, g, 3, λ)-dDF in Z gυ
In this paper, several recursive constructions for directed difference family and perfect directed difference family are presented by means of difference matrix and incomplete difference matrix. Finally the ne...
-
Article
Decompositions of the 3-uniform hypergraphs K v (3) into hypergraphs of a certain type
In this paper, we investigate a generalization of graph decomposition, called hypergraph decomposition. We show that a decomposition of a 3-uniform hypergraph K v ...
-
Article
Tripling Construction for Large Sets of Resolvable Directed Triple Systems
In this paper, we first define a doubly transitive resolvable idempotent quasigroup (DTRIQ), and show that a DTRIQ of order v exists if and only if v ≡ 0 (mod 3) and v ≢ 2 (mod 4). Then we use DTRIQ to present a ...
