Self-dual \( 1 \)-configurations \( (n_d)_1 \) have the most \( K_d \)-separated Menger graph \( \mathcal{Y} \) for connected self-dual configurations \( (n_d) \). Such \( \mathcal{Y} \) is most symmetric if it is \( K_d \)-ultrahomogeneous. In this work, such a graph \( \mathcal{Y} \) is presented for \( (n, d) = (102, 4) \) and shown to relate \( n \) copies of the cuboctahedral graph \( L(Q_3) \) to the \( n \) copies of \( K_4 \). These are shown to share each copy of \( K_3 \) with two copies of \( L(Q_3) \). Vertices and copies of \( L(Q_3) \) in \( \mathcal{Y} \) are the points and lines of a self-dual \( (104_{12})_1 \).

A Roman dominating function (RDF) on a graph \( G \) is a function \( f: V(G) \to \{0,1,2\} \) satisfying the condition that every vertex \( u \) with \( f(u) = 0 \) is adjacent to at least one vertex \( v \) for which \( f(v) = 2 \). The weight of a Roman dominating function is the value \( f(V(G)) = \sum_{u \in V(G)} f(u) \). The Roman domination number, \( \gamma_{R}(G) \), of \( G \) is the minimum weight of a Roman dominating function on \( G \). An RDF \( f \) is called an independent Roman dominating function if the set of vertices assigned non-zero values is independent. The independent Roman domination number, \( i_R(G) \), of \( G \) is the minimum weight of an independent RDF on \( G \). In this paper, we improve previous bounds on the independent Roman domination number of a graph.

It has been conjectured that the edge domination number of the \( m \times n \) grid graph, denoted by \( \gamma'(P_m \Box P_n) \), is \( \lceil mn/3 \rceil \) when \( m, n \geq 2 \). Our main result gives support for this conjecture by proving that \( \lceil mn/3 \rceil \leq \gamma'(P_m \Box P_n) \leq mn/3 + n/12 + 1 \), when \( m, n \geq 2 \). We furthermore show that the conjecture holds when \( mn \) is a multiple of three and also when \( m \leq 13 \). Despite this support for the conjecture, our proofs lead us to believe that the conjecture may be false when \( m \) and \( n \) are large enough and \( mn \) is not a multiple of three. We state a new conjecture for the values of \( \gamma'(P_m \Box P_n) \).

In this paper, we present some patterns related to derangements. We find the distribution of the \( \delta’ \)-transformation applied to all unicyclic derangements of order \( n \), and the distribution of the \( \delta’ \)-transformation applied to all derangements of order \( n \), considered in one-line notation. We introduce the notion of a matrix of forbidden pairs that helps us in solving our problems. We also give and prove a theorem related to derangements.

We present a new type of tournament design that we call a complete mixed doubles round robin tournament, \( \text{CMDRR}(n, k) \), that generalizes spouse-avoiding mixed doubles round robin tournaments and strict Mitchell mixed doubles round robin tournaments. We show that \( \text{CMDRR}(n, k) \) exist for all allowed values of \( n \) and \( k \) apart from 4 exceptions and 31 possible exceptions. We show that a fully resolvable \( \text{CMDRR}(2n, 0) \) exists for all \( n \geq 5 \) and a fully resolvable \( \text{CMDRR}(3n, n) \) exists for all \( n \geq 5 \) and \( n \) odd. We prove a product theorem for constructing \( \text{CMDRR}(n, k) \).

Recently introduced invariants, copoint pre-hull number and convex pre-hull number, are both numerical measures of nonconvexity of a graph \( G \) that is a convex space. We consider in this work both the Cartesian and the strong product of graphs. Exact values in terms of invariants of the factors are presented for the first mentioned product. For the strong product, it is shown that such a result does not exist, but an exact result for trees is proved.

In this note, we provide bijective proofs of some identities involving the Bell number, as previously requested. Our arguments may be extended to yield a generalization in terms of complete Bell polynomials. We also provide a further interpretation for a related difference of Catalan numbers in terms of the inclusion-exclusion principle.

Given a graph \( G = (V, E) \) and \( A_1, A_2, \ldots, A_r \), mutually disjoint nonempty subsets of \( V \) where \( |A_i| \leq |V|/r \) for each \( i \), we say that \( G \) is spanning equi-cyclable with respect to \( A_1, A_2, \ldots, A_r \) if there exist mutually disjoint cycles \( C_1, C_2, \ldots, C_r \) that span \( G \) such that \( C_i \) contains \( A_i \) for every \( i \) and \( C_i \) contains either \( \lfloor |V|/r \rfloor \) vertices or \( \lceil |V|/r \rceil \) vertices. Moreover, \( G \) is \( r \)-\({spanning-equicyclable}\) if \( G \) is spanning equi-cyclable with respect to \( A_1, A_2, \ldots, A_r \) for every such mutually disjoint nonempty subsets of \( V \). We define the spanning equi-cyclability of \( G \) to be \( r \) if \( G \) is \( k \)-spanning-equicyclable for \( k = 1, 2, \ldots, r \) but is not \( (r + 1) \)-spanning-equicyclable. Another approach on the restriction of the \( A_i \)’s is the following. We say that \( G = (V, E) \) is \( r \)-\({cyclable\; of\; order}\) \( t \) if it is cyclable with respect to \( A_1, A_2, \ldots, A_r \) for any \( r \) nonempty mutually disjoint subsets \( A_1, A_2, \ldots, A_r \) of \( V \) such that \( |A_1 \cup A_2 \cup \ldots \cup A_r| \leq t \). The \( r \)-cyclability of \( G \) is \( t \) if \( G \) is \( r \)-cyclable of order \( k \) for \( k = r, r+1, \ldots, t \) but is not \( r \)-cyclable of order \( t + 1 \). On the other hand, the cyclability of \( G \) of order \( t \) is \( r \) if \( G \) is \( k \)-cyclable of order \( t \) for \( k = 1, 2, \ldots, r \) but is not \( (r + 1) \)-cyclable of order \( t \). In this paper, we study sufficient conditions for spanning equi-cyclability and \( r \)-cyclability of order \( t \) as well as other related problems.

The existence of additive BIB designs and 2 pairwise additive BIB designs has been discussed with direct and recursive constructions in [6, 9]. In this paper, by reorganizing some methods of constructing pairwise additive BIB designs from other combinatorial structures, it is shown that 3 pairwise additive \( B(v, 2, 1) \) can be constructed for any integer \( v \geq 6 \).

A lot of research has been spent determining the domination numbers, \( \gamma_{m,n} \), of grid graphs. But relatively little effort has been given to constructing minimum dominating sets of grid graphs. In this paper, we introduce a method for constructing \( \gamma \)-sets of grid graphs \( G_{m,n} \) for all \( m \geq 16 \) and \( n \geq 16 \). Further, for \( G_{m,n} \), \( m < 16 \), \( m \neq 12, 13 \), we show how particular \( \gamma \)-sets can be used to construct \( \gamma \)-sets for other grid graphs.