Proposed in 1942, the Graph Reconstruction Conjecture posits that every simple, finite, undirected graph with three or more vertices can be reconstructed up to isomorphism to the original graph, given the multiset of subgraphs produced by deleting each vertex along with its incident edges. Related to this Reconstruction Conjecture, existential reconstruction numbers, \( \exists rn(G) \), concern the minimum number of vertex-deleted subgraphs required to identify a graph up to isomorphism.We discuss the resulting data from calculating reconstruction numbers for all simple, undirected graphs with up to ten vertices. From this data, we establish the reasons behind all high existential reconstruction numbers (\( \exists rn(G) > 3 \)) for \( |V(G)| \leq 10 \) and identify new classes of graphs that have high reconstruction numbers for \( |V(G)| > 10 \).We also consider 2-reconstructibility—the ability to reconstruct a graph \( G \) from the multiset of subgraphs produced by deleting each combination of two vertices from \( G \). The 2-reconstructibility of all graphs with nine or fewer vertices was tested, identifying four graphs in this range with five vertices as the highest order of graphs that are not 2-reconstructible.

A weighing matrix \( W(n, k) \) of order \( n \) with weight \( k \) is an \( n \times n \) matrix with entries from \( \{0, 1, -1\} \) which satisfies \( WW^T = kI_n \). Such a matrix is group-developed if its rows and columns can be indexed by elements of a finite group \( G \) so that \( w_{g,h} = w_{gf,hf} \) for all \( g,h,f \) in \( G \). Group-developed weighing matrices are a natural generalization of perfect ternary arrays and Hadamard matrices. They are closely related to difference sets.

We describe a search for weighing matrices with order 60 and weight 25, developed over solvable groups. There is one known example of a \( W(60, 25) \) developed over a non-solvable group; no solvable examples are known.

We use techniques from representation theory, including a new viewpoint on complementary quotient images, to restrict solvable examples. We describe a computer search strategy which has eliminated two of twelve possible cases. We summarize plans to complete the search.

A \( (p,q) \)-graph \( G \) is said to be edge graceful if the edges can be labeled by \( 1, 2, \ldots, q \) so that the vertex sums are distinct, mod \( p \). It is shown that if a tree \( T \) is edge-graceful, then its order must be odd. Lee conjectured that all trees of odd orders are edge-graceful. In [7], we establish that every tree of odd order with one even vertex is edge-graceful. Mitchem and Simoson [19] introduced the concept of super edge-graceful graphs, which is a stronger concept than edge-graceful for trees. We show that every tree of odd order with three even vertices is super edge-graceful.

It is known that there is not any non-trivial graph with vertices of distinct degrees, and any non-trivial graph must have at least two vertices of the same degree. In this article, we will consider the concept of \( P_3 \)-degree of vertices and will introduce a class of connected graphs with exactly two vertices of the same \( P_3 \)-degree. Also, the graphs with distinct \( P_3 \)-degree vertices will be constructed and it will be proven that for any \( n \geq 6 \) there is at least one graph of order \( n \), with distinct \( P_3 \)-degree vertices.

Let \( a, b \) be two positive integers. A \( (p, q) \)-graph \( G \) is said to be \( Q(a)P(b) \)-super edge-graceful, or simply \( (a, b) \)-SEG, if there exist onto mappings \( f : E(G) \to Q(a) \) and \( f^* : V(G) \to P(b) \), where

\[
Q(a) = \begin{cases}
\{\pm a, \pm(a+1), \ldots, \pm(a + (q-2)/2)\} & \text{if } q \text{ is even}, \\
\{0, \pm a, \pm(a+1), \ldots, \pm(a + (q-3)/2)\} & \text{if } q \text{ is odd},
\end{cases}
\]

\[
P(b) = \begin{cases}
\{\pm b, \pm(b+1), \ldots, \pm(b + (p-2)/2)\} & \text{if } p \text{ is even}, \\
\{0, \pm b, \pm(b+1), \ldots, \pm(b + (p-3)/2)\} & \text{if } p \text{ is odd},
\end{cases}
\]

such that \( f^*(v) = \sum_{uv \in E(G)} f(uv) \). We find the values of \( a \) and \( b \) for which the hypercube \( Q_n, n \leq 3 \), is \( (a, b) \)-SEG.

A map is a graph that admits an orientation of its edges so that each vertex has out-degree exactly \(1\). We characterize graphs which admit a decomposition into \(k\) edge-disjoint maps after: (1) the addition of any \(\ell\) edges; (2) the addition of some \(\ell\) edges. These graphs are identified with classes of \emph{sparse} graphs; the results are also given in matroidal terms.

A connected graph on three or more vertices is said to be irreducible if it has no leaves, and if each vertex has a unique neighbor set. A connected graph on one or two vertices is also said to be irreducible, and a disconnected graph is irreducible if each of its connected components is irreducible. In this paper, we study the class of irreducible graphs. In particular, we consider an algorithm that, for each connected graph \( \Gamma \), yields an irreducible subgraph \( I(\Gamma) \) of \( \Gamma \). We show that this subgraph is unique up to isomorphism. We also show that almost all graphs are irreducible. We then conclude by highlighting some structural similarities between \( I(\Gamma) \) and \( \Gamma \).

A Latin square of order \( n \) is an \( n \) by \( n \) array in which every row and column is a permutation of a set \( N \) of \( n \) elements. Let \( L = [l_{i,j}] \) and \( M = [m_{i,j}] \) be two Latin squares of even order \( n \), based on the same \( N \)-set. Define the superposition of \( L \) onto \( M \) to be the \( n \) by \( n \) array \( A = (l_{i,j}, m_{i,j}) \). When \( n \) is even, \( L \) and \( M \) are said to be \({nearly\; orthogonal}\) if the superposition of \( L \) onto \( M \) has every ordered pair \( (i, j) \) appearing exactly once except for \( i = j \), when the ordered pair appears \( 0 \) times and except for \( i – j = \frac{n}{2} \pmod{n} \), when the ordered pair appears \( 2 \) times. A set of \( t \) Latin squares of order \( 2m \) is called a set of \({mutually\; nearly\; orthogonal\; Latin \;squares}\) (MNOLS(\(2m\))) if the \( t \) Latin squares are pairwise nearly orthogonal. We provide two elementary proofs for results that were stated and proved earlier. We also provide some computer results and prove two recursive constructions for MNOLS. Using these results we show that there always exist \( 3 \) mutually nearly orthogonal Latin squares of order \( 2m \), for \( 2m \geq 358 \).

Given a connected graph \( G \) with \( n \) vertices, a routing \( R \) is a collection of \( n(n-1) \) paths, one path \( R(x,y) \) for each ordered pair \( x, y \) of vertices. A routing is said to be vertex/edge-antisymmetric if for every pair \( x, y \) of vertices, the paths \( R(x,y) \) and \( R(y,x) \) are internally vertex/edge-disjoint. Compared to other types of routing found in the literature, antisymmetric routing is interesting from a practical point of view because it ensures greater network reliability.

For a given graph \( G \) and routing \( R \), the vertex/edge load of \( G \) with respect to \( R \) is the maximum number of paths passing through any vertex/edge of \( G \). The \({vertex/edge-forwarding-index}\) of a graph is the minimum vertex/edge load taken over all routings. If routing \( R \) is vertex/edge-antisymmetric, we talk about \({antisymmetric-indices}\).

Several results exist in the literature for the forwarding-indices of graphs. In this paper, we derive upper and lower bounds for the antisymmetric-indices of graphs in terms of their connectivity or minimum degree. These bounds are often the best possible. Whenever this is the case, a network that meets the corresponding bound is described. Several related conjectures are proposed throughout the paper.

A tree \( R \) such that after deleting all leaves we obtain a path \( P \) is called a \({caterpillar}\). The path \( P \) is called the \({spine}\) of the caterpillar \( R \). If the spine has length 3 and \( R \) on \( 2n \) vertices contains vertices of degrees \( r \), \( s \), \( t \), \( 2 \), where \( 2 < r, s, t < n \), then we say that \( R \) is an \( (r, s, t, 2) \)-\({caterpillar}\) of diameter 5. We completely characterize \( (r, s, t, 2) \)-caterpillars of diameter 5 on \( 4k+2 \) vertices that factorize the complete graph \( K_{4k+2} \).