Various \(n\)-color restricted partition functions are studied. Two different \(n\)-color analogues of the Gaussian polynomials are given.

There is a lexicographic ordering of \((0, 1)\)-tuples. Thus, the rows of a \((0, 1)\)-matrix can be ordered lexicographically decreasing from the top by permutations, or analogously the columns from the left. It is shown that \((0, 1)\)-matrices allow a simultaneous ordering of the rows and the columns. Those matrices are called doubly ordered, and their structure is determined. An answer is given to the question of whether a \((0, 1)\)-matrix can be transformed into a block diagonal matrix by permutations of the rows and the columns; in fact, the double ordering of a \((0, 1)\)-matrix already displays the finest block diagonal structure. Moreover, fast algorithms are presented that double order a \((0, 1)\)-matrix.

In this paper, we show that a graph \(G\) with \(e \geq 6\) edges contains at most \(\frac{h(h-1)(h-2)(h-3)}{2}\) paths of length three, where \(h \geq 0\) satisfies \(\frac{h(h-1)}{2} = e\). It follows immediately that \(G\) contains at most \(\frac{h(h-1)(h-2)(h-3)}{8}\) cycles of length four. For \(e > 6\), the bounds will be attained if and only if \(h\) is an integer and \(G\) is the union of \(K_h\) and isolated vertices. The bounds improve those found recently by Bollobás and Sarkar.

Let \(p > 2\) be a prime, and \(G = C_{p^{e_1}} \oplus \ldots \oplus C_{p^{e_k}}\) (\(1 \leq e_1 \leq \cdots \leq e_k\)) a finite abelian \(p\)-group. We prove that \(1 + 2\sum_{i=1}^{k}(p^{e_i} – 1)\) is the smallest integer \(t\) such that every sequence of \(t\) elements in \(G\) contains a zero-sum subsequence of odd length. As a consequence, we derive that if \(p^{e_k} \geq 1 + \sum_{i=1}^{k-1} (p^{e_i} – 1)\), then every sequence of \(4p^{e_k} – 3 + 2\sum_{i=1}{k-1} (p^{e_i} – 1)\) elements in \(G\) contains a zero-sum subsequence of length \(p^{e_k}\).

Solutions for the edge-isoperimetric problem on the graphs of the triangular and hexagonal tessellations of the Euclidean plane are given. The proofs are based on the fact that their symmetry group is Coxeter. In each case, there is a certain nice quotient of the stability order of the graph (which is itself a quotient of the Bruhat order of the Coxeter group by a parabolic subgroup).

For a graph \(G = (V,E)\), a set \(S \subseteq V\) is \(total\; irredundant\) if for every vertex \(v \in V\), the set \(N[v]- N[S – \{v\}]\) is not empty. The \(total \;irredundance\; number\) \(ir_t(G)\) is the minimum cardinality of a maximal total irredundant set of \(G\). We study the structure of the class of graphs which do not have any total irredundant sets; these are called \(ir_t(0)\)-graphs. Particular attention is given to the subclass of \(ir_t(0)\)-graphs whose total irredundance number either does not change (stable) or always changes (unstable) under arbitrary single edge additions. Also studied are \(ir_t(0)\)-graphs which are either stable or unstable under arbitrary single edge deletions.

Let \(n_1, n_2, \ldots, n_k\) be integers of at least two. Johansson gave a minimum degree condition for a graph of order exactly \(n_1 + n_2 + \cdots + n_k\) to contain \(k\) vertex-disjoint paths of order \(n_1, n_2, \ldots, n_k\), respectively. In this paper, we extend Johansson’s result to a corresponding packing problem as follows. Let $G$ be a connected graph of order at least \(n_1 + n_2 + \cdots + n_k\). Under this notation, we show that if the minimum degree sum of three independent vertices in \(G\) is at least:

\[3(\lfloor \frac{n_1}{2}\rfloor+\lfloor \frac{n_2}{2}\rfloor+ \ldots +\lfloor \frac{n_k}{2}\rfloor)\]

then \(G\) contains \(k\) vertex-disjoint paths of order \(n_1, n_2, \ldots, n_k\), respectively, or else \(n_1 = n_2 = \cdots = n_e = 3\), or \(k = 2\) and \(n_1 = n_2 = \text{odd}\). The graphs in the exceptional cases are completely characterized. In particular, these graphs have more than \(n_1 + n_2 + \cdots + n_k\) vertices.

In this work, first, we present sufficient conditions for a bipartite digraph to attain optimum values of a stronger measure of connectivity, the so-called superconnectivity. To be more precise, we study the problem of disconnecting a maximally connected bipartite (di)graph by removing nontrivial subsets of vertices or edges. Within this framework, both an upper-bound on the diameter and Chartrand type conditions to guarantee optimum superconnectivities are obtained. Secondly, we show that if the order or size of a bipartite (di)graph is small enough then its vertex connectivity or edge-connectivity attain their maximum values. For example, a bipartite digraph is maximally edge-connected if \(\delta^+(x)+\delta^+(y)\geq \lceil\frac{n+1}{2}\rceil\) for all pair of vertices \(x, y\) such that \(d(x,y) \geq 4\). This result improves some conditions given by Dankelmann and Volkmann in [12] for the undirected case.