We obtain a formula for the number of finite lattices of a given height and cardinality that have a series-parallel and interval order. Our approach is to consider a naturally defined class of \(m\) nested intervals on an \(m+k\)-element chain, and we show that there are \(\binom{m-1}{k-1}\gamma(m+1)\) such sets of nested intervals. Here, \(\gamma(m+1)\) denotes the Catalan number \(\frac{1}{m+1}\binom{2m}{m}\).

\({Graph \; integrity}\), a measure of graph vulnerability, has drawn considerable attention of graph theorists in recent years. We have given a set of sufficient conditions for the weighted integrity problem to be NP-Complete for a class of graphs. As a corollary of this result, we have shown that the weighted graph integrity problem is NP-Complete on many common classes of graphs on which the unweighted integrity problem is either polynomial or of unknown complexity. We have shown that the weighted graph integrity problem is polynomial for interval graphs.

It is known that if there are base sequences of lengths \(m+1\), \(m+1\), \(m\), \(m\) and \(y\) is a Yang number, then there are \(T\)-sequences of lengths \(y(2m + 1)\). Base sequences of lengths \(m+1\), \(m+1\), \(m\), \(m\) form \(26\), \(27\), \(28\) and some new decompositions into squares are constructed. \(T\)-sequences of lengths \(61(2m + 1)\) for some new decompositions into squares are also presented.

As a network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible reconstruction of the network. Many graph theoretical parameters have been used to describe the stability of communication networks, including connectivity, integrity, toughness, tenacity, and binding number. Several of these deal with two fundamental questions about the resulting graph. How many vertices can still communicate? How difficult is it to reconnect the graph? For any fixed integers \(n,p\), with \(p \geq n+1\), Harary constructed classes of graphs \(H_{n,p}\), that are \(n\)-connected with the minimum number of edges. Thus Harary graphs are examples of graphs with maximum connectivity. This property makes them useful to network designers and thus it is of interest to study the behavior of other stability parameters for the Harary graphs. In this paper, we study the tenacity of the Harary graphs.

In this note, we study a group operation on the set of all row-Latin squares of order \(n\) and, as a result, are able to provide a short disproof of the Euler conjecture for infinitely many values of \(n\). We also discuss several related conjectures.

Three general constructions for covers are given. A cover is a set of \(k\)-subsets of a \(v\)-set, \(V\), such that every \(t\)-subset of \(V\) is contained in at least one of the \(k\)-sets. These constructions use the idea of dividing the \(v\)-set into either two or three equal sized subsets. The last two constructions also use the idea of establishing a correspondence between the two equal subsets in order to facilitate the construction.

In a complete bipartite graph \(K_{s,t}\), each vertex of one vertex set is joined to each vertex of the second vertex set by exactly one edge; An Eulerian orientation of \(K_{s,t}\) assigns directions to the edges in such a way that the resulting digraph has an Eulerian dicircuit. Similarly, any Eulerian circuit of \(K_{s,t}\) ascribes directions to the edges and results in an Eulerian orientation. This paper investigates Eulerian orientations and circuits of \(K_{s,t}\). Exact solutions are presented for \(s = 2\) and \(t = 4\). Computer searches were used to obtain results for other small values of \(s\) and \(t\). These results also lead to two conjectures which deal with upper and lower bounds on the numbers of Eulerian circuits.