In this paper, the congruence relations and the lower and upper bounds of hyper-Wiener index for \(k\)-membered ring spiro systems given length \(n\) are determined respectively. As these results’ applications,the congruence relations and the extremal five- and six-membered ring spiro systems with maximal and minimal hyper-Wiener index are given respectively.

Let \(G\) be a finite group and \(S \subseteq G \setminus \{0\}\). We call \(S\) an additive basis of \(G\) if every element of \(G\) can be expressed as a sum over a nonempty subset in some order. Let \(cr(G)\) be the smallest integer \(t\) such that every subset of \(G \setminus \{0\}\) of cardinality \(t\) is an additive basis of \(G\). In this paper, we determine \(cr(G)\) for the following cases: (i) \(G\) is a finite nilpotent group; (ii) \(G\) is a group of even order which possesses a subgroup of index \(2\).

For \(n \geq 1\), we let \(a_n\) count the number of compositions of the positive integer \(m\), where the last summand is odd. We find that \(a_n = (\frac{1}{3})(-1)^n + (\frac{2}{3}) 2^{n-1}\). Since \(J_n\), the \(n\)-th Jacobsthal number, is given as \(\frac{1}{3}(-1)^n + \frac{2}{3}2^{n-1}\) for \(n \geq 0\), it follows that \(a_n = J_{n-1}\) for \(n \geq 1\). For this reason, these compositions are often referred to as the Jacobsthal compositions.

In our investigation, we determine results for the \(a_n\) compositions of \(n\), such as: (i) \(a_{n,k}\), the number of times the positive integer \(k\) appears as a summand among these \(a_n\) compositions of \(n\); (ii) the numbers of plus signs, summands, even summands, and odd summands that occur for these compositions of \(n\); (iii) the sum of the even summands and the sum of the odd summands for the \(a_n\) compositions of \(n\); (iv) the numbers of levels, rises, and descents for the \(a_n\) compositions; and (v) the number of runs that occur among these \(a_n\) compositions.

In this paper, we introduce a new sequence called standard Young words, which are defined as quaternary words with interesting restrictions. First, we show that the cardinality of standard Young words of length n is related to Catalan triangle sequence and we establish a bijection from the set of standard Young words to the set of pairs of non-intersection lattice paths. Then we set a one-to-one correspondence between the set of standard Young words and the set of standard Young tableaux of two rows, which results in the correspondence between the statistics of standard Young words and standard Young tableaux, such as sign and descents.

A graph \(G\) is called a fractional \((k, m)\)-deleted graph if after deleting any \(m\) edges of \(G\), the resulting graph admits a fractional \(k\)-factor. In this paper, we prove that for \(k \geq 2\) and \(m \geq 0\), \(G\) is a fractional \((k, m)\)-deleted graph if one of the following conditions holds: 1) \(n \geq 4k + 4m – 3\), \(\delta(G) \geq k + m\), and \(\max\{d_G(u), d_G(v)\} \geq \frac{n}{2}\) for each pair of non-adjacent vertices \(u\) and \(v\) of \(G\); 2) \(\delta(G) \geq k + m\), \(\omega_2(G) \geq n\), \(n \geq 4k + 4m – 5\) if \((k, m) = (3, 0)\), and \(n \geq 8\) if \((k, m) = (3, 0)\). The results are best possible in some sense.