It’s well known that all of the pooling designs constructed are based on a finite set or a finite vector space. In this paper, we construct two families of pooling designs not only based on finite sets (resp. finite vector spaces) but also on partial mappings (resp. partial linear mappings), and discuss their error-tolerance properties.

Let \( 2^{[m]} \) be ordered by set inclusion, and let \( \mathcal{B} \subseteq 2^{[m]} \) be an antichain. An antichain \( \mathcal{B} \) is called \( k \)-regular (\( k \in \mathbb{N} \)) if for each \( i \in [m] \) there are exactly \( k \) blocks \( B_1, B_2, \ldots, B_k \in \mathcal{B} \) containing \( i \). An antichain is called flat if there exists a positive integer \( l \) such that \( l \leq |B| \leq l+1 \) for all \( B \in \mathcal{B} \), and we call an antichain maximal if the collection of sets \( \mathcal{B} \cup \{B\} \) is not an antichain for all \( B \notin \mathcal{B} \). We call a maximal \( k \)-regular antichain \( \mathcal{B} \subseteq \binom{[m]}{2} \cup \binom{[m]}{3} \) a \( (k,m) \)-MFRAC. In this paper we analyze \( (k,m) \)-MFRACs in the cases \( m \leq 7 \), \( k = m \), \( k = m-1 \), and \( k = m-2 \). We provide some constructions, give necessary conditions for existence, and mention some open problems.

Generalized binomial coefficients are considered. The aim of this paper is to provide a new general combinatorial interpretation of the Lucas-nomial and \( (p,q) \)-nomial coefficients in terms of tiling of \( d \)-dimensional rectangular boxes. The recurrence relation of these numbers is proved in a combinatorial way. To this end, our results are extended to the case of corresponding multi-nomial coefficients.

In this paper, we determine the necessary and sufficient conditions for the existence of simple incomplete triple systems for all \( \lambda \leq 6 \).

Dudeney’s round table problem asks for a set of Hamilton cycles in \( K_n \), having the property that each \( 2 \)-path in \( K_n \) lies in exactly one of the cycles. In this paper, we show how to construct a solution of Dudeney’s round table problem for even \( n \) from a semi-antipodal Hamilton decomposition of \( K_{n-1} \).

Using the spectral invariants of graphs, we present sufficient conditions for some stable properties of graphs.

A matching \( M \) in a graph \( G \) is a subset of \( E(G) \) in which no two edges have a vertex in common. A vertex \( V \) is unsaturated by \( M \) if there is no edge of \( M \) incident with \( V \). A matching \( M \) is called a perfect matching if there is no vertex of the graph that is unsaturated by \( M \). Let \( G \) be a \( k \)-edge-connected graph, \( k \geq 1 \), on even \( n \) vertices, with minimum degree \( r \) and maximum degree \( r + e \), \( e \geq 1 \). In this paper, we find a lower bound for \( n \) when \( G \) has no perfect matchings.

Two kinds of authentication schemes are constructed using singular symplectic geometry over finite fields in this paper. One is an authentication code with arbitration, another is a multi-receiver authentication code. The parameters of two kinds of codes have been computed. Under the assumption that the encoding rules of the transmitter and the receiver are chosen according to a uniform probability distribution, the maximum probabilities of success of different types of deception attacks are also computed.

If \( G_1 \) and \( G_2 \) are two graphs, then the edge amalgamation \( G_1 *_e G_2 \) is defined to be the graph obtained by identifying some given edge of \( G_1 \) with some given edge of \( G_2 \). In this paper, it is shown that \( \gamma(G_1 *_e G_2 *_e \ldots *_e G_n) = \lceil \frac{n}{2} \rceil \) where \( G_i \) (\( 1 \leq i \leq n \)) is a critical graph of minimum genus \( 1 \).

A set \( S \subseteq V \) is a dominating set of a graph \( G = (V, E) \) if each vertex in \( V \) is either in \( S \) or is adjacent to a vertex in \( S \). A vertex is said to dominate itself and all its neighbors. A set \( S \subseteq V \) is a \({total \;dominating\; set}\) of a graph \( G = (V, E) \) if each vertex in \( V \) is adjacent to a vertex in \( S \). In total domination, a vertex no longer dominates itself. These two types of domination can be thought of as representing the vertex set of a graph as the union of the closed (domination) and open (total domination) neighborhoods of the vertices in the set \( S \). A set \( S \subseteq V \) is a \({total, efficient\; dominating\; set}\) (also known as an \({efficient \;open\; dominating \;set}\)) of a graph \( G = (V, E) \) if each vertex in \( V \) is adjacent to exactly one vertex in \( S \). In 2002, Gavlas and Schultz completely classified all cycle graphs that admit a total, efficient dominating set. This paper extends their result to two classes of Cayley graphs.