The clique-chromatic number of a graph is the least number of colors on the vertices of the graph without a monocolored maximal clique of size at least two.In \(2004\), Bacsé et al. proved that the family of line graphs has no bounded clique-chromatic number. In particular, the Ramsey numbers provide a sequence of the line graphs of complete graphs with no bounded clique-chromatie number. We
complete this result by giving the exact values of the clique-chromatic numbers of the line graphs of complete graphs in terms of Ramsey numbers. Furthermore, the clique-chromatic numbers of the line graphs of triangle-free graphs are characterized.

The current article focuses on the generalized \(k\)-Pell \((p, i)\)-numbers for \(k = 1, 2, \ldots\) and \(0 \leq i \leq p\). It introduces the generalized \(k\)-Pell \((p, i)\)-numbers and their generating matrices and generating functions. Some interesting identities are established.

For a graph \(G\), let \({Z}(G)\) be the total number of matchings in \(G\). For a nontrivial graph \(G\) of order \(n\) with vertex set \(V(G) = \{v_1, \ldots, v_n\}\), Cvetković et al. \([2]\) defined the triangle graph of \(G\), denoted by \(R(G)\), to be the graph obtained by introducing a new vertex \(v_{ij}\) and connecting \(u_{ij}\) both to \(v_i\) and to \(v_j\) for each edge \(v_iv_j\) in \(G\). In this short paper, we prove that for a connected graph \(G\), if \({Z}(R(G)) \geq (\frac{1}{2}n-\frac{1}{2}+\frac{5}{2n})^2\), then \(G\) is traceable. Moreover, for a connected graph \(G\), we give sharp upper bounds for \({Z}(R(G))\) in terms of clique number, vertex connectivity, and spectral radius of \(G\), respectively.

We prove a two-point concentration for the tree domination number of the random graph \(G_{n,p}\) provided \(p\) is constant or \(p \to 0\) sufficiently slow.

A 2-independent set in a graph \(G\) is a subset \(J\) of the vertices such that the distance between any two vertices of \(J\) in \(G\) is at least three. The number of 2-independent sets of a graph \(G\) is denoted by \(i_2(G)\). For a forest \(F\), \(i_2(F – e) > i_2(F)\) for each edge \(e\) of \(F\). Hence, we exclude all forests having isolated vertices. A forest is said to be extra-free if it has no isolated vertex. In this paper, we determine the \(k\)-th largest number of 2-independent sets among all extra-free forests of order \(n \geq 2\), where \(k = 1, 2, 3\). Extremal graphs achieving these values are also given.

The notion of multiparameter \(q\)-noncentral Stirling numbers is introduced by means of a triangular recurrence relation. Some properties for these \(q\)-analogues such as vertical and horizontal recurrence relations, horizontal generating functions, explicit formula, orthogonality and inverse relations are established. Moreover, we introduce the multiparameter Bell numbers and Bell polynomials, their connection to factorial moments and their respective \(q\)-analogues.

Let \(a, b\), and \(k\) be nonnegative integers with \(2 \leq a \leq 6\) and \(b \equiv 0 \pmod{a-1}\). Let \(G\) be a graph of order \(n\) with \(n \geq \frac{(a+b-1)(2a+b-4)-a+1}{b} + k\). A graph \(G\) is called an \((a, b, k)\)-critical graph if after deleting any \(k\) vertices of \(G\), the remaining graph has an \([a, b]\)-factor. In this paper, it is proved that \(G\) is an \((a, b, k)\)-critical graph if and only if \[|N_G(X)| >\frac{(a-1)n + |X| + bk-1}{a+b-1} \] for every non-empty independent subset \(X\) of \(V(G)\), and \[\delta(G) > \frac{(a-1)n + b + bk}{a+b-1}.\] Furthermore, it is shown that the result in this paper is best possible in some sense.

Two-dimensional codes in \(LRTJ\) spaces are subspaces of the space \(Mat_{m\times s}(\mathbb{Z}_q)\), the linear space of all \(m \times s\)-matrices with entries from a finite ring \(\mathbb{Z}_q\), endowed with the \(LRTJ\)-metric \([3,9]\). Also, the error-correcting capability of a linear code depends upon the number of parity-check symbols. In this paper, we obtain a lower bound on the number of parity checks of two-dimensional codes in \(LRTJ\)-spaces correcting both independent as well as cluster array errors.

Let \(G = (V, E)\) be a graph without an isolated vertex. A set \(D \subseteq V(G)\) is a total dominating set if \(D\) is dominating and the induced subgraph \(G[D]\) does not contain an isolated vertex. The total domination number of \(G\) is the minimum cardinality of a total dominating set of \(G\). A set \(D \subseteq V(G)\) is a total outer-connected dominating set if \(D\) is total dominating and the induced subgraph \(G[V(G) – D]\) is connected. The total outer-connected domination number of \(G\) is the minimum cardinality of a total outer-connected dominating set of \(G\). We characterize all unicyclic graphs with equal total domination and total outer-connected domination numbers.

We give a characterization of strongly multiplicative graphs. First, we introduce some necessary conditions for a graph to be strongly multiplicative.Second, we discuss the independence of these necessary conditions. Third, we show that they are altogether not sufficient for a graph to be strongly multiplicative. Fourth, we add another necessary condition. Fifth, we prove that this necessary condition is stronger than the mentioned necessary conditions except one. Finally, we conjecture that the condition itself is stronger than all of them.