Let \(C_n\) denote the cycle with \(n\) vertices, and \(C_n^{(t)}\) denote the graphs consisting of \(t\) copies of \(C_n\), with a vertex in common. Koh et al. conjectured that \(C_n^{(t)}\) is graceful if and only if \(nt \equiv 0,3 \pmod{4}\). The conjecture has been shown true for \(n = 3,5,6,7,9,11,4k\). In this paper, the conjecture is shown to be true for \(n = 13\).

This paper deals with a connection between the universal circuits matrix \([10]\) and the crossing relation \([1,5]\). The value of the universal circuits matrix obtained for \(\overline{\omega}\), where \(\omega\) is an arbitrary feedback function that generates de Bruijn sequences, forms the binary matrix that represents the crossing relation of \(\omega\). This result simplifies the design and study of the feedback functions that generate the de Bruijn sequences and allows us to decipher many inforrnations about the adjacency graphs of another feedback functions. For example, we apply these results to analyze the Hauge-Mykkeltveit classification of a family of de Bruijn sequences \([4]\).

In a given graph \(G\), a set \(S\) of vertices with an assignment of colors is a defining set of the vertex coloring of \(G\), if there exists a unique extension of the colors of \(S\) to a \(\chi(G)\)-coloring of the vertices of \(G\). A defining set with minimum cardinality is called a smallest defining set (of vertex coloring) and its cardinality, the defining number, is denoted by \(d(G, \chi)\). Let \(d(n, r, \chi = k)\) be the smallest defining number of all \(r\)-regular \(k\)-chromatic graphs with \(n\) vertices. Mahmoodian \(et.\; al [7]\) proved that, for a given \(k\) and for all \(n \geq 3k\), if \(r \geq 2(k-1)\) then \(d(n, r, \chi = k) = k-1\). In this paper we show that for a given \(k\) and for all \(n < 3k\) and \(r \geq 2(k – 1)\), \(d(n, r, \chi = k) = k-1\).

A two-colored digraph \(D\) is primitive if there exist nonnegative integers \(h\) and \(k\) with \(h+k > 0\) such that for each pair \((i,j)\) of vertices there exists an \((h, k)\)-walk in \(D\) from \(i\) to \(j\). The exponent of the primitive two-colored digraph \(D\) is the minimum value of \(h + k\) taken over all such \(h\) and \(k\). In this paper, we consider the exponents of families of two-colored digraphs of order \(n\) obtained by coloring the digraph that has the exponent \((n – 1)^2\). We give the tight upper bound on the exponents, and the characterization of the extremal two-colored digraph.

A graceful labeling of a graph \(G\) with \(m\) edges is a function \(f: V(G) \to \{0, \ldots, m\}\) such that distinct vertices receive distinct numbers and \(\{|f(u) – f(v)|: uv \in E(G)\} = \{1, \ldots, m\}\). A graph is graceful if it has a graceful labeling. In \([1]\) this question was posed: “Is there an \(n\)-chromatic graceful graph for \(n \geq 6\)?”. In this paper it is shown that for any natural number \(n\), there exists a graceful graph \(G\) with \(\chi(G) = n\).

A connected graph \(G = (V, E)\) is said to be \((a, d)\)-antimagic, for some positive integers \(a\) and \(d\), if its edges admit a labeling by all the integers in the set \(\{1, 2, \ldots, |E(G)|\}\) such that the induced vertex labels, obtained by adding all the labels of the edges adjacent to each vertex, consist of an arithmetic progression with the first term \(a\) and the common difference \(d\). Mirka Miller and Martin Ba\'{e}a proved that the generalized Petersen graph \(P(n, 2)\) is \((\frac{3n+3}{2}, 3)\)-antimagic for \(n \equiv 0 \pmod{4}\), \(n \geq 8\) and conjectured that \(P(n, k)\) is \((\frac{3n+6}{2}, 3)\)-antimagic for even \(n\) and \(2 \leq k \leq \frac{n}{2}-1\). The first author of this paper proved that \(P(n, 3)\) is \((\frac{3n+6}{2}, 3)\)-antimagic for even \(n \geq 6\). In this paper, we show that the generalized Petersen graph \(P(n, 2)\) is \((\frac{3n+6}{2} , 3)\)-antimagic for \(n \equiv 2 \pmod{4}\), \(n \geq 10\).

Let \(0 \leq p \leq [\frac{r+1}{2}]\) and \(\sigma(K_{r+1}^{-p},n)\) be the smallest even integer such that each \(n\)-term graphic sequence with term sum at least \(\sigma(K_{r+1}^{-p},n)\) has a realization containing \(K_{r+1}^{-p}\) as a subgraph, where \(K_{r+1}^{-p}\) is a graph obtained from a complete graph \(K_{r+1}\) on \(r+1\) vertices by deleting \(p\) edges which form a matching. In this paper, we determine \(\sigma(K_{r+1}^{-p},n)\) for \(r \geq 2, 1 \leq p \leq [\frac{r+1}{2}]\) and \(n \geq 3r + 3\). As a corollary, we also determine \(\sigma(K_{1^*,2^t}n)\) for \(t \geq 1\) and \(n \geq 3s + 6t\), where \(K_{1^*,2^t}\) is an \(r_1\times r_2\times \ldots \times r_{s+t}\) complete \((s + t)\)-partite graph with \(r_1 = r_2 = \ldots = r_s = 1\) and \(r_{s+1} = r_{s+2} = \ldots = r_{s+t} = 2\) and \(\sigma(K_{1^*,2^t},n)\) is the smallest even integer such that each \(n\)-term graphic sequence with term sum at least \(\sigma(K_{1^*,2^t},n)\) has a realization containing \(K_{1^*,2^t}\) as a subgraph.

Let \(n, s_1\) and \(s_2\) be positive integers such that \(1 \leq s_1 \leq n/2, 1 \leq s_2 \leq n/2, s_1 \neq s_2\) and \(gcd(n, s_1, s_2) = 1\). An undirected double-loop network \(G(n;\pm s_1,\pm s_2)\) is a graph \((V, E)\), where \(V = \mathbb{Z}_n = \{0, 1, 2, \ldots, n-1\}\), and \(E = \{(i \to i+s_1 \mod n), (i\to i-s_1 \mod n), (i\to i+s_2 \mod n), (i\to i-s_2 \mod n) | i = 0, 1, 2, \ldots, n-1\}\). In this paper, a diameter formula is given for an undirected double-loop network \(G(n; \pm s_1, \pm s_2)\). As its application, two new optimal families of undirected double-loop networks are presented.

Anthony J. Macula constructed a \(d\)-disjunct matrix \(\delta(n,d,k)\) in \([1]\), and we now know it is determined by one type of pooling space. In this paper, we give some properties of \(\delta(n,d,k)\) and its complement \(\delta^c(n,d,k)\).

Let \(S\) be a primitive non-powerful signed digraph. The base \(l(S)\) of \(S\) is the smallest positive integer \(l\) such that for all ordered pairs of vertices \(i\) and \(j\) (not necessarily distinct), there exists a pair of \(SSSD\) walks of length \(t\) from \(i\) to \(j\) for each integer \(t \geq l\). In this work, we use \(PNSSD\) to denote the class of all primitive non-powerful signed symmetric digraphs of order \(n\) with at least one loop. Let \(l(n)\) be the largest value of \(l(S)\) for \(S \in\) \(PNSSD\), and \(L(n) = \{l(S) | S \in PNSSD\}\). For \(n \geq 3\), we show \(L(n) = \{2, 3, \ldots, 2n\}\). Further, we characterize all primitive non-powerful signed symmetric digraphs of order \(n\) with at least one loop whose bases attain \(l(n)\).