An open-locating-dominating set of a graph models a detection system for a facility with a possible “intruder” or a multiprocessor network with a possible malfunctioning processor. A “sensor” or “detector” is assumed to be installed at a subset of vertices where each can detect an intruder or a malfunctioning processor in its neighborhood, but not at its own location. We consider a fault-tolerant variant of an open-locating-dominating set called an error-correcting open-locating-dominating set, which can correct a false-positive or a false-negative signal from a detector. In particular, we prove the problem of finding a minimum error-correcting open-locating-dominating set in an arbitrary graph is NP-complete. Additionally, we characterize the existence criteria for an error-correcting open-locating-dominating set in an arbitrary graph. We also consider extremal graphs that require every vertex to be a detector and minimum error-correcting open-locating-dominating sets in infinite grids.

Let \( G = (V, E) \) be a graph with vertex set \( V \) and edge set \( E \). A set \( S \subset V \) is a dominating set if every vertex in \( V – S \) is adjacent to at least one vertex in \( S \), an independent set if no two vertices in \( S \) are adjacent, and a total dominating set if every vertex in \( V \) is adjacent to at least one vertex in \( S \). The domatic number \( \text{dom}(G) \), idomatic number \( \text{idom}(G) \), and total domatic number \( \text{tdom}(G) \), of a graph \( G \) equal the maximum order \( k \) of a partition \( \pi = \{V_1, V_2, \ldots, V_k\} \) of \( V \) into {dominating sets, independent dominating sets, total dominating sets}, respectively. A queens graph \( Q_n \) is a graph defined on the \( n^2 \) squares of an \( n \)-by-\( n \) chessboard, such that two squares are adjacent if and only if a queen on one square can move to the other square in one move, that is, the two squares lie on a common row, column, or diagonal. In this note, we determine the value of these three numbers for \( Q_n \) for the first several values of \( n \). In addition, we introduce the concepts of graphs being \( \gamma \)-domatic, \( i \)-domatic, \( \alpha \)-domatic, \( \Gamma \)-domatic, \( \gamma_t \)-domatic, and \( \Gamma_t \)-domatic.

Let \(\mathcal{F}\) be a family of graphs, and \(H\) a “host” graph. A spanning subgraph \(G\) of \(H\) is called \(\mathcal{F}\)- saturated in \(H\) if \(G\) contains no member of \(\mathcal{F}\) as a subgraph, but \(G+e\) contains a member of \(\mathcal{F}\) for any edge \(e\in E(H) – E(G)\). We let \(Sat(H,\mathcal{F})\) be the minimum number of edges in any graph \(G\) which is \(\mathcal{F}\)-saturated in \(H\), where \(Sat(H,\mathcal{F}) = |E(H)|\) if \(H\) contains no member of \(\mathcal{F}\) as a subgraph. Let \(P_{m}^{r}\) be the \(r\)-dimensional grid, with entries in each coordinate taken from \(\{1,2,\cdots , m\}\), and \(K_{t}\) the complete graph on \(t\) vertices. Also let \(S(F)\) be the family of all subdivisions of a graph \(F\). There has been substantial previous work on extremal questions involving subdivisions of graphs, involving both \(Sat(K_{n},S(F))\) and the Turan function \(ex(K_{n},S(F))\), for \(F = K_{t}\) or \(F\) a complete bipartite graph. In this paper we study \(Sat(H, S(F))\) for the host graph \(H = P_{m}^{r}\), and \(F = K_{4}\), motivated by previous work on \(Sat(K_{n}, S(K_{t}))\). Our main results are the following; 1) If at least one of \(m\) or \(n\) is odd with \(m\geq 5\) and \(n\geq 5\), then \(Sat(P_{m}\times P_{n}, S(K_{4})) = mn + 1.\) 2) For \(m\) even and \(m\geq 4\), we have \(m^{3} + 1 \le Sat(P_{m}^{3}, S(K_{4}))\le m^{3} + 2.\) 3) For \( r\geq 3\) with \(m\) even and \(m\geq 4\), we have \(Sat(P_{m}^{r}, S(K_{4})) \le m^{r} + 2^{r-1} – 2\).

An undirected graph is said to be cordial if there is a friendly (0,1)-labeling of the vertices that induces a friendly (0,1)-labeling of the edges. An undirected graph \(G\) is said to be \((2,3)\)-orientable if there exists a friendly (0,1)-labeling of the vertices of \(G\) such that about one-third of the edges are incident to vertices labeled the same. That is, there is some digraph that is an orientation of \(G\) that is \((2,3)\)-cordial. Examples of the smallest noncordial/non-\((2,3)\)-orientable graphs are given, and upper bounds on the possible number of edges in a cordial/\((2,3)\)-orientable graph are presented. It is also shown that if \(T\) is a linear operator on the set of all undirected graphs on \(n\) vertices that strongly preserves the set of cordial graphs or the set of \((2,3)\)-orientable graphs, then \(T\) is a vertex permutation.

With the social progress and technological development, China’s criminal activities gradually show the characteristics of specialization, networking, and hotspotting, which leads to the phenomenon of high incidence but low detection rate, and the prediction of the criminal phenomenon is particularly important. In this paper, we construct a graph self-encoder, and derive the formula of the GAE loss function from the corresponding reconstructed neighbor matrix and node feature loss function of GAE. The spatial channel attention mechanism is introduced to improve the performance of the model, and the time window dimension is mapped to the perceptual self-attention module, and the objective function is constructed by generating a collection of crime matrices for future time windows. A multi-raster layer analysis model is added to optimize the model, generate a risk map of criminal activities, quantify the risk value of each element, and form a spatio-temporal prediction effect. Comparison experiments are used to analyze the optimization effect of the model, and the absolute error of the optimized model is no more than 0.05 for four types of cases. The prediction results of the cases of property invasion in different time periods show that the number of cases occurring in the early hours of the morning is 508, and the average PEI index is 0.19, which is smaller compared with other time periods.

With the rapid urbanization and expansion of subway rail transit, the subway has become an essential mode of public transportation. This study explores the impact of subway car color design on passengers’ psychological responses. Utilizing computer vision technology and a pruning algorithm, a target detection model for passenger expression recognition was developed, serving as an intuitive measure of psychological reactions. An optimized expression feature extraction network was constructed for facial expression recognition, while a multidimensional data analysis model, based on data mining, provided comprehensive insights. The study reveals that green, red, and yellow lighting evoke positive psychological responses, whereas blue and purple induce calmer or more somber reactions. These findings offer valuable guidance for urban subway carriage color lighting design, enhancing passenger experience.

As economic globalization progresses, air transport has become increasingly vital to economic development due to its speed and convenience. This study examines the driving forces of airside economic construction across four levels: primary, secondary, derivative, and permanent influences. It explores the dynamic interplay between the aviation industry and airside economic construction. Using the entropy weight method to optimize the grey situation decision-making theory, the paper investigates the development strategies for Henan Province’s airside economy. Results indicate that the H2 area should be prioritized as the key construction zone, achieving the highest effect measurement score of 0.9789. Furthermore, focusing on the development of the tertiary industry or the joint advancement of secondary and tertiary industries in the H2 area yields the most significant economic impact, with effect measurement scores of 0.755 and 0.749, respectively.

This paper explores the integration of blockchain technology into the teaching quality evaluation system of universities. A practical teaching quality evaluation index system for applied technology universities is developed, ensuring data authenticity through blockchain’s de-trusting mechanism. To enhance data storage efficiency, the PBFT consensus algorithm is improved and incorporated into a technical architecture adopting an “off-chain storage + on-chain sharing” model. The algorithm scoring formula and improved PBFT consensus algorithm are analyzed to demonstrate their effectiveness. Practical applications in applied technology universities highlight the benefits of blockchain in higher education evaluation. The CBFT-based consensus algorithm achieves average CPU utilization of 13.4% compared to 18.5% in traditional algorithms, while ensuring data transparency and tamper-proofing. Additionally, the algorithm improves transaction throughput and reduces resource consumption, enabling efficient operation of the teaching evaluation system in applied sciences universities.