In paper \([7]\), S. J. Xu and W. Jin proved that a cyclic group of order \(pq\), for two different odd primes \(p\) and \(q\), is a \(3\)-BCI-group, and a finite \(p\)-group is a weak \((p – 1)\)-BCI-group. As a continuation of their works, in this paper, we prove that a cyclic group of order \(2p\) is a \(3\)-BCI-group, and a finite \(p\)-group is a \((p – 1)\)-BCI-group.

Fifty-five new or improved lower bounds for \(A(n, d, w)\), the maximum possible number of binary vectors of length \(n\), weight \(w\), and pairwise Hamming distance no less than \(d\), are presented.

We give some estimates of the norm of weighted composition operators from \(\alpha\)-Bloch spaces to Bloch-type spaces on the unit ball in \(7\).

Let \(G\) be a graph with vertex set \(V(G)\) and edge set \(E(G)\). The isolated toughness of \(G\) is defined as
\(I(G) = \min\left\{\frac{|S|}{i(G-S)}: S \subseteq V(G), i(G-S) \geq 2\right\}\)
if \(G\) is not complete. Otherwise, set \(I(G) = |V(G)| – 1\). Let \(a\) and \(b\) be positive integers such that \(1 \leq a \leq b\), and let \(g(x)\) and \(f(x)\) be positive integral-valued functions defined on \(V(G)\) such that \(a \leq g(x) \leq f(x) \leq b\). Let \(h(e) \in [0,1]\) be a function defined on \(E(G)\), and let \(d(x) = \sum_{e \in E_x} h(e)\) where \(E_x = \{xy : y \in V(G)\}\). Then \(d(x)\) is called the fractional degree of \(x\) in \(G\). We call \(h\) an indicator function if \(g(x) \leq d(x) \leq f(x)\) holds for each \(x \in V(G)\). Let \(E^h = \{e : e \in E(G), h(e) \neq 0\}\) and let \(G_h\) be a spanning subgraph of \(G\) such that \(E(G_h) = E^h\). We call \(G_h\) a fractional \((g,f)\)-factor. The main results in this paper are to present some sufficient conditions about isolated toughness for the existence of fractional \((g,f)\)-factors. If \(1 = g(x) < f(x) = b\), this condition can be improved and the improved bound is not only sharp but also a necessary and sufficient condition for a graph to have a fractional \([1,b]\)-factor.

Let \((G,C)\) be an edge-colored bipartite graph with bi-partition \((X,Y)\). A heterochromatic matching of \(G\) is such a matching in which no two edges have the same color. Let \(N^c(S)\) denote a maximum color neighborhood of \(S \subseteq V(G)\).

The spanning tree packing number of a connected graph \(G\), denoted by \(\tau(G)\), is the maximum number of edge-disjoint spanning trees of \(G\). In this paper, we determine the minimum number of edges that must be added to \(G\) so that the resulting graph has spanning tree packing number at least \(k\), for a given value of \(k\).

Let \(\gamma_{\overline{E}}\) and \(\gamma_{\overline{S}}\) be the minus edge domination and minus star domination numbers of a graph, respectively, and let \(\gamma_E\), \(\beta_1\), \(\alpha_1\) be the edge domination, matching, and edge covering numbers of a graph. In this paper, we present some bounds on \(\gamma_{\overline{E}}\) and \(\gamma_{\overline{S}}\) and characterize the extremal graphs of even order \(n\) attaining the upper bound \(\frac{n}{2}\) on \(\gamma_{\overline{E}}\). We also investigate the relationships between the above parameters.

The Wiener index of a connected graph is defined as the sum of all distances between unordered pairs of vertices. We determine the unicyclic graphs of given order, cycle length and number of pendent vertices with minimum Wiener index.

In this paper, by using the generating functions of Fibonacci polynomial sequences and their partial derivatives, we work out some identities involving the Fibonacci polynomials. As their primary applications, we obtain several identities involving the Fibonacci numbers and Lucas numbers.

Fukuda and Handa \([7]\) asked whether every even partial cube \(G\) is harmonic-even. It is shown that the answer is positive if the isometric dimension of \(G\) equals its diameter which is in turn true for partial cubes with isometric dimension at most \(6\). Under an additional technical condition it is proved that an even partial cube \(G\) is harmonic-even or has two adjacent vertices whose diametrical vertices are at distance at least \(4\). Some related open problems are posed.