In the last two decades, mathematicians have discussed various transivities of automorphism groups of designs (i.e., point, block, and flag transivities), from all these studies, we know that
\[
0 \leq O^{\#}(G, \mathbf{B}) – O^{\#}(G, \mathbf{X}) \leq |\mathbf{B}| – |\mathbf{X}|
\]
for \(2-(v, k, \lambda)\) designs (see \([\)BMP\]). In this paper, we discuss the orbit structure of general combinatorial designs $\mathbf{D}(\mathbf{X}, \mathbf{B})$ and obtain the equalities \[O^{\#}(G, \mathbf{F}) = \sum\limits_{i=1}^{u} O^{\#}(H(x_i), X_{i}) =\sum\limits_{j=1}^{l} O^{\#}(H(B_j), B_j),
\]
where \(H(x_i)\) and \(H(B_j)\) are the stabilizers of the point \(x_i\) and the block \(B_j\) respectively, \(u = O^{\#}(G, \mathbf{X})\), \(l = O^{\#}(G, \mathbf{B})\).

The problem of determining which graphs have the property that every maximal independent set of vertices is also a maximum independent set was proposed by M.D. Plummer
in 1970 [28]. This was partly motivated by the observation that whereas determining the independence number of an arbitrary graph is NP-complete, for a well-covered graph one can
simply apply the greedy algorithm. Although a good deal of effort has been expended in an
attempt to obtain a complete characterization of such graphs, that result appears as elusive as ever. In this paper, intended to serve as an introduction to the problem, several of the main attacks will be highlighted with particular emphasis on the approach involving the girth of such graphs.

We consider whether an order-ten Latin square with an order-four Latin subsquare can belong to an orthogonal triple of Latin squares. We eliminate \(20\) of \(28\) possibilities for how this could occur by considering the structure of possible mates. Our technique supplements the small collection of existing tools for obtaining negative results regarding
the existence of collections of orthogonal Latin squares.

The partitions into Baer subplanes of the Desarguesian projective planes of order \(9\), \(16\), and \(25\) are classified by computer. It is also shown that the non-Desarguesian projective planes of order \(9\) and the non-Desarguesian translation planes of order \(16\) and \(25\) do not admit such a partition.

It is known that the ovoids in \({O}_5(q)\), \(q \leq 7\), are classical ovoids. Using algebraic and computational techniques, we classify ovoids in \({O}_5(9)\) and \({O}_5(11)\) with the aid of a computer. We also study the ovoids which contain an irreducible conic and classify them in \({O}_5(13)\). Our results show that there is only one nonclassical ovoid (a member from a family of Kantor) up to isomorphism in \({O}_5(9)\) and all the ovoids in \({O}_5(11)\) are classical.

A symmetric design \((U, \mathcal{A})\) is a strong subdesign of a symmetric design \((V, \mathcal{B})\) if \(U \subseteq V\) and \(\mathcal{A}\) is the set of non-empty
intersections \(B \cap U\), where \(B \in \mathcal{B}\). We demonstrate three constructions of symmetric designs, where this notion is useful, and produce two new infinite families of symmetric designs with parameters \(v = \left(\frac{73^{m+1} – 64}{9}\right), k = 73^m,\lambda = 9 \cdot 73^{m-1}\) and \(v = 1+2(q + 1)\left(\frac{(q + 1)^{2m} – 1}{q+2}\right), k = (q + 1)^{2m}, \lambda = \frac{(q + 1)^{2m-1} (q + 2)}{2}\) where \(m\) is a positive integer and \(q = 2^p – 1\) is a Mersenne prime. The main tools in these constructions are generalized Hadamard matrices and balanced generalized weighing matrices.

The least deviant path was defined by Klostermeyer \([1]\) as the path between two vertices \(u\) and \(v\) that minimizes the difference between the largest and smallest weights on the path. This paper presents an \(O(E \log E)\) time algorithm for this problem in undirected graphs, improving upon the previously given \(O(E^{1.793})\) time algorithm.
The same algorithm can also be used to solve the problem in \(O(VE)\) time in directed graphs.

It is well-known that the set of all circulations of a connected digraph \(G\) on \(p\) vertices with \(q\) edges forms a ternary linear code \(\text{C} = \text{C}_E(G)\)
with parameters \([q, q – p + 1, g]\), where \(g\) is the girth of \(G\). Such codes were first studied by Hakimi and Bredeson \([8]\) in \(1969\), who investigated problems
of augmenting \(\text{C}\) to a larger \((q, k, g)\)-code and efficiently decoding such codes. Their treatment was similar to their previous work on binary codes \([4, 7]\).
Recently, we have made significant progress in the binary case by generalizing Hakimi’s and Bredeson’s construction method to obtain better augmenting codes and developing a more efficient decoding algorithm. In this paper, we explore how our methods can be
adapted to achieve corresponding progress in the ternary case. In particular, we will correct an oversight in a graph-theoretic lemma of Bredeson and Hakimi, which affects their decoding algorithms and discuss alternative decoding procedures based on a connection to a challenging optimization problem.

Let \(G\) be a graph and let \(S\) be a subset of vertices of \(G\). The open neighborhood of a vertex \(v\) of \(G\) is the set of all vertices adjacent to \(v\) in \(G\). The set \(S\) is an open packing of \(G\) if the open neighborhoods of the vertices of \(S\) are pairwise disjoint in \(G\). The lower open packing number of \(G\), denoted \(\rho_L^o(G)\), is the minimum cardinality of a maximal open packing of \(G\), while the (upper) open packing number of \(G\), denoted \(\rho^o(G)\), is the maximum cardinality among all open packings of \(G\). In this paper, we present theoretical and computational
results for the open packing numbers of a graph.