Green construction is becoming a mainstream model of the transformation and upgrading of the construction industry, which has the advantages of energy saving, environmental protection and ecology, which can effectively reduce energy deficiency and improve environmental quality, which is the need for high quality sustainable development. This study is based on BIM software and the intelligent construction technology to propose the green architectural design party case. Building energy-saving efficiency evaluation system, using fuzzy Borda method and the CRITIC method of evaluation, the objective of the index, and the example of a community, the use of the object meta-effect model. The evaluation scores of the energy saving efficiency of the building of green energy saving and renovation are in the 90.11-99.28 points, and the high energy demand in the process of running the use of the building is excellent in the heating, refrigeration and other aspects of the building. This paper shows that the goal of the green transformation project is basic, which is effective and the efficiency of energy efficiency is generated. This study can provide guidance for the work of the green building energy saving and renovation work, and further promote the energy saving and transformation of China.

The supply chain applies large number according to the technology, can reduce the cost of each link, optimize the resource allocation, increase the enterprise benefit. In this paper, the supply chain cost control program based on large number according to the previous forecast, the control of the event and the analysis of the three levels of the analysis of the supply chain. The combination time series model and the multivariate regression model, the joint CPFR concept, the establishment of the CPFR sales combination demand prediction model, the design form according to the sales prediction system, the resource optimization plan of the supply chain inventory in real time. Analyze the prediction effect of the combination prediction model, predict the product sales in the week, calculate the product safety inventory and the remaining inventory. The analysis is based on the cost control effect of the enterprise supply chain according to the sales forecast. The cost of purchasing the supply chain costs less than the operating income, which fell to 0.5107in 2023. The gross margin of gross profit was 0.53666 in 2023, which was controlled by the gross margin, and the gross profit was improved. It is said that the enterprise is using large number according to the technology to the supply chain resource optimization in the supply chain cost control, the cost control effect is better.

The research of modular and personalized balance strategy in assembly building design can improve the efficiency of construction and meet the demand of design diversification. Based on bim technology, an assembly building modular design method is proposed to determine the required space module, to determine the required space module, to strengthen the module structure, to set up the layout of the building, to formulate the modular panel and the assembly frame platform, and through the revit implementation of the three-dimensional visual design of modularity and personalization. The design of the 9 building of this article, in the collaborative function, spatial adaptability and the design diversity score in turn for 10th 10 “10” 9 points (full score 10). This article is designed to meet the demand of the building in daylighting and ventilation, the average daylighting coefficient is 6.440%, and the minimum value of the floor area of the building room is 18.25cent. Modular and personalized assembly frame structures have a better seismic resistance, and their limit cumulative energy consumption is 2.38 times the traditional way. Experts have the highest social benefit satisfaction in this article strategy, and the satisfaction score is 92.05.

Based on the definition of volatility and conditional value risk (CVaR), this paper introduces the implied volatility into CVaR model, and further analyzes the partial differential equation of stock portfolio optimization in the form of BS model. In the process of multi-stage investment, in order to reasonably control the investment risk of each stage, the CvaR model based on implied volatility is constructed by using the scenario tree method. With the data of 1166 trading days as the data, 4 stock assets as the data set of this study, the optimization model is applied to the calculation and analysis. The numerical simulation shows that the stock price fluctuation of the four multi-cycle stocks ranges from -23.45% to 41.97%, showing a clustering phenomenon. Among them, the volatility of stocks A and C is more obvious than that of stocks B and D, and the probability density tails of stocks are longer in the cycle, and they all show thick tail characteristics, indicating that the introduction of implied volatility of CVaR model makes the risk control of actual equity asset investment more reasonable.

In this paper, the characteristics and distribution of the spatial clustering diffusion characteristics and distribution of the spatial accumulation of rural areas are quantified by using the GIS space analysis method, the analysis method of the nuclear density estimation, the hotspot analysis, the spatial self-correlation, and the large number of the rural areas of Chongqing. Compared with the difference of the amount of the education facility in Chongqing, the difference between the amount of the education facility was compared, and the development gap of the education facility was assessed. The study showed that in 2023, the imbalance coefficient of the school of compulsory education in Chongqing was reduced from 0.3637 in 2013 to 0.02433 in 2023, and the primary school stage was reduced from 0.3582 to 0.1952. This paper shows that the imbalance coefficient of education resource layout in Chongqing is decreasing year by year, and the spatial equilibrium of resource space increases. This study provides the effective thinking and method for the adjustment of the education resource space layout structure in Chongqing, and provides the scientific decision basis for the calibration of the existing planning and the formulation of future planning.

This paper discusses the appreciation of the elderly to influence the actual exchange rate by using the requirements structure and the current account mechanism. Using the internal actual exchange rate formula and the Balassa-Samuelson effect, the propagation mechanism of the aging of the population was established. This paper discusses the influence of aging on trade balance, and sets up the panel model of countries of different age categories. Through heterogeneity analysis and multivariate regression test assessment. The study of mathematical methods found that the rate of pension care significantly affected the actual effective exchange rate. In countries where aging and moderate aging lead to depreciation, aging and non-ageing countries can rise.

In this paper, the basic Wiener filter structure and adaptive algorithm module are used to optimize the parameter adjustment and data noise processing in the adaptive filter algorithm. Based on the LMS criterion, the algorithm is further refined by quantization error and affine projection optimization, which improves the accuracy and speed of vortex and circulation data analysis. The optimized algorithm reduces noise and covariance error, and achieves excellent performance in filtering evaluation (SRTAE: \(1.623\times10^{-2}\,\text{m}\) and \(1.162\times10^{-4}\,\text{m/s}\)). The results show that the spatio-temporal coupling effect between vortex and circulation can be found through numerical modeling and spatio-temporal analysis. This study provides a valuable reference for promoting the application of computational mathematics in the field of climate monitoring.

The stretched Littlewood-Richardson coefficient \(c^{t\nu}_{t\lambda,t\mu}\) was conjectured by King, Tollu, and Toumazet to be a polynomial function in \(t\). It was shown to be true by Derksen and Weyman using semi-invariants of quivers. Later, Rassart used Steinberg’s formula, the hive conditions, and the Kostant partition function to show a stronger result that \(c^{\nu}_{\lambda,\mu}\) is indeed a polynomial in variables \(\nu, \lambda, \mu\) provided they lie in certain polyhedral cones. Motivated by Rassart’s approach, we give a short alternative proof of the polynomiality of \(c^{t\nu}_{t\lambda,t\mu}\) using Steinberg’s formula and a simple argument about the chamber complex of the Kostant partition function.

In this work, we study type B set partitions for a given specific positive integer \(k\) defined over \(\langle n \rangle = \{-n, -(n-1), \cdots, -1, 0, 1, \cdots, n-1, n\}\). We found a few generating functions of type B analogues for some of the set partition statistics defined by Wachs, White and Steingrímsson for partitions over positive integers \([n] = \{1, 2, \cdots, n\}\), both for standard and ordered set partitions respectively. We extended the idea of restricted growth functions utilized by Wachs and White for set partitions over \([n]\), in the scenario of \(\langle n \rangle\) and called the analogue as Signed Restricted Growth Function (SRGF). We discussed analogues of major index for type B partitions in terms of SRGF. We found an analogue of Foata bijection and reduced matrix for type B set partitions as done by Sagan for set partitions of \([n]\) with specific number of blocks \(k\). We conclude with some open questions regarding the type B analogue of some well known results already done in case of set partitions of \([n]\).

Suppose that \(\phi\) is a proper edge-\(k\)-coloring of the graph \(G\). For a vertex \(v \in V(G)\), let \(C_\phi(v)\) denote the set of colors assigned to the edges incident with \(v\). The proper edge-\(k\)-coloring \(\phi\) of \(G\) is strict neighbor-distinguishing if for any adjacent vertices \(u\) and \(v\), \(C_\phi(u) \varsubsetneq C_\phi(v)\) and \(C_\phi(v) \varsubsetneq C_\phi(u)\). The strict neighbor-distinguishing index, denoted \(\chi’_{snd}(G)\), is the minimum integer \(k\) such that \(G\) has a strict neighbor-distinguishing edge-\(k\)-coloring. In this paper we prove that if \(G\) is a simple graph with maximum degree five, then \(\chi’_{snd}(G) \leq 12\).

Let \(2 \le k \in \mathbb{Z}\). A total coloring of a \(k\)-regular simple graph via \(k+1\) colors is an efficient total coloring if each color yields an efficient dominating set, where the efficient domination condition applies to the restriction of each color class to the vertex set. In this work, focus is set upon graphs of girth \(k+1\). Efficient total colorings of finite connected simple cubic graphs of girth 4 are constructed starting at the 3-cube. It is conjectured that all of them are obtained by means of four basic operations. In contrast, the Robertson 19-vertex \((4,5)\)-cage, the alternate union \(Pet^k\) of a (Hamilton) \(10k\)-cycle with \(k\) pentagon and \(k\)-pentagram 5-cycles, for \(k > 1\) not divisible by 5, and its double cover \(Dod^k\), contain TCs that are nonefficient. Applications to partitions into 3-paths and 3-stars are given.

Using generating functions, we are proposing a unified approach to produce explicit formulas, which count the number of nodes in Smolyak grids based on various univariate quadrature or interpolation rules. Our approach yields, for instance, a new formula for the cardinality of a Smolyak grid, which is based on Chebyshev nodes of the first kind and it allows to recover certain counting-formulas previously found by Bungartz-Griebel, Kaarnioja, Müller-Gronbach, Novak-Ritter and Ullrich.

Topological indices have become an essential tool to investigate theoretical and practical problems in various scientific areas. In chemical graph theory, a significant research work, which is associated with the topological indices, is to deduce the ideal bounds and relationships between known topological indices. Mathematical development of the novel topological index is valid only if the topological index shows a good correlation with the physico-chemical properties of chemical compounds. In this article, the chemical applicability of the novel GQ and QG indices is calibrated over physico-chemical properties of 22 benzenoid hydrocarbons. The GQ and QG indices predict the physico-chemical properties of benzenoid hydrocarbons, significantly. Additionally, this work establishes some mathematical relationships between each of the GQ and QG indices and each of the graph invariants: size, degree sequences, maximum and minimum degrees, and some well-known degree-based topological indices of the graph.

Cultural heritage represents the historical and cultural achievements of a nation, playing a vital role in studying human civilization and preserving national languages and scripts. This study utilizes virtual simulation technology to design a virtual pavilion for Chinese language and writing, employing image and text feature extraction algorithms for feature fusion and 3D modeling. The effectiveness of Chinese character extraction is validated through feature point matching, while the virtual exhibition’s impact is assessed via user experience scores. Results indicate that the proposed algorithm achieves accurate extraction with no misrecognition. User interest rankings highlight text images as the most influential factor, followed by visual imagery, pavilion experience, scene art, and language culture. Analysis of user feedback shows an average experience score exceeding 60 points, confirming the pavilion’s effectiveness in preserving and promoting Chinese language and writing culture.

In recent years, due to the adjustment of economic structure, the people’s living standard and the increase of leisure time, the sports industry has become a new economic growth point. This paper studies and analyzes the characteristics of the industry background and business background of the sports industry, explores the factors and internal driving force affecting the design of its business model, and fully analyzes the mechanism, functional role, and logical relationship of the elements for constructing the business model of the sports industry, and then explores the characteristics of the business style of the sports industry. From the perspective of knowledge state, using the reinforcement learning mechanism, the evolution process of the sports industry business model from the first stage to the fourth stage is described. Taking Company H as a research case, the process and economic effect of the transformation and upgrading of its business model through the reinforcement learning mechanism is analyzed and it is found that as of 2023 the company’s operating income has increased by 2.4 times through transformation and upgrading, and its net profit has increased by 125.57 percentage points compared to 2016. It further understands the role that the enhanced learning mechanism brings to the development of the sports industry, and expects to be able to provide a reference for the sports industry to carry out business model transformation in the future.

We initiate a study of the toughness of directed graphs by considering the natural generalization of that for ordinary graphs. After providing some general results, computations are completed for a few natural examples. Maximum possible toughness is also considered. Some open problems are  posed.

Let \(G\) and \(H\) be graphs and \(1\) be a positive number. An \(H\)-irregular labeling of \(G\) is an assignment of integers from \(1\) up to \(k\) to either vertices, edges, or both in \(G\) such that each sum of labels in a subgraph isomorphic to \(H\) are pairwise distinct. Moreover, a comb product of \(G\) and \(H\) is a construction of graph obtained by attaching several copies of \(H\) to each vertices of \(G\). Meanwhile, an edge comb product of \(G\) and \(H\) is an alternate construction where the copies of \(H\) is attached on edges of \(G\) instead. In this paper, we investigate the vertex, edge, and total \(H\)-irregular labeling of \(G\) where both \(G\) and \(H\) is either a comb product or an edge comb product of graphs.

This study applies Support Vector Machine (SVM) and K-Nearest Neighbors (KNN) algorithms to classify five types of basketball footwork. SVM maps the training data into a high-dimensional space using nonlinear transformation and classifies it with support vectors and a hyperplane. Experimental analysis showed minimal differences in peak and trough values of footwork movements; therefore, only mean and standard deviation features were retained, resulting in 12 effective features. KNN experiments demonstrated that recognition accuracy varies with different K values. The highest accuracy (80.7%) was achieved when K = 5 with the selected features. The study also examined the physical characteristics of basketball players, analyzing height, weight, and other indicators. Statistical results showed no significant body shape differences between experimental and control groups (P > 0.05). A T-test on dribbling, shooting, and layup performance also revealed no significant differences between the groups (P > 0.05).

This study explores the employment competitiveness of computer science majors by integrating combinatorial mathematics into the evaluation process. Utilizing the Analytic Hierarchy Process (AHP) and the improved FKCM clustering algorithm, we construct a hierarchical model to assess the impact of entrepreneurial education, learning motivation, and investment on job competitiveness. Data from 314 participants were analyzed using combinatorial techniques to derive optimal weightings for each factor, ensuring the evaluation model’s robustness. The results highlight significant gender differences in practical and feedback-based entrepreneurship education, with males outperforming females. However, no notable differences were observed in job interest, learning motivation, or overall employment competitiveness.

An (unrooted) binary tree is a tree in which every internal vertex has degree \(3\). In this paper, we determine the minimum and maximum number of total dominating sets in binary trees of a given order. The corresponding extremal binary trees are characterized as well. The minimum is always attained by the binary caterpillar, while the binary trees that attain the maximum are only unique when the number of vertices is not divisible by~\(4\). Moreover, we obtain a lower bound on the number of total dominating sets for \(d\)-ary trees and characterize the extremal trees as well.

This paper proposes an optimized Backpropagation (BP) neural network for improving intelligent elderly care talent training. To address BP’s limitations, including noise sensitivity and slow convergence, we introduce Particle Swarm Optimization (PSO) to refine network weights and thresholds. The model integrates course quality, teacher effectiveness, platform support, and market demand, aiming to optimize elderly care service talent cultivation. Experimental results demonstrate a significant improvement in prediction accuracy, with average error reduced from 9.94% to 6.3%. This enhanced model offers a more efficient and accurate solution for aligning educational outcomes with industry needs.

Amnesty international is recognized as a key force in promoting social development, with higher education also facing the need for innovation. This paper explores new opportunities in educational theory and policy proposed in a recent initiative. The proposal emphasizes filtering ideology, political education, and public opinion to enhance the accuracy of ideological and political teaching. By incorporating personal suggestions through interviews, the model recommends learning materials tailored to student characteristics. System implementation and testing demonstrate its potential as a core tool for ideological education in colleges, supporting the integration of knowledge, politics, and technology to meet students’ educational needs.

Networks with smaller strong diameters generally have better fault tolerance because they enable closer connections between vertices, leading to shorter information paths. This allows the network to maintain communication and functionality more effectively during attacks or failures. In contrast, larger strong diameters mean vertices are connected over longer distances, increasing vulnerability to disruptions. Thus, the strong diameter is a key metric for assessing and optimizing network fault tolerance. This paper determines the optimal orientations for the Cartesian and strong products of even cycles, provides the minimum strong diameters and their bounds under specific conditions, and establishes a lower bound for the maximum strong diameter. A conjecture about the exact value of the maximum strong diameter is also proposed.

For a graph \(F\) and a positive integer \(t\), the edge-disjoint Ramsey number \(ER_t(F)\) is the minimum positive integer \(n\) such that every red-blue coloring of the edges of the complete graph \(K_n\) of order \(n\) results in \(t\) pairwise edge-disjoint monochromatic copies of a subgraph isomorphic to \(F\). Since \(ER_1(F)\) is in fact the Ramsey number of \(F\), this concept extends the standard concept of Ramsey number. We investigate the edge-disjoint Ramsey numbers \(ER_t(K_{1, n})\) of the stars \(K_{1, n}\) of size \(n\). Formulas are established for \(ER_t(K_{1, n})\) for all positive integers \(n\) and \(t = 2, 3, 4\) and bounds are presented for \(ER_t(K_{1, n})\) for all positive integers \(n\) and \(t \ge 5\). Furthermore, exact values of \(ER_t(K_{1, n})\) are determined for \(n = 3, 4\) and several integers \(t \ge 5\).

The development of artificial intelligence enables computers to not only simulate human artistic creations, but also synthesize fine art works with deeper meanings based on natural images. This study digitally parses the fusion of fine art and philosophy visual expressions, and develops a visual expression system based on the fusion of fine art and philosophy by utilizing a variety of key big data algorithms for visual expressions such as adversarial networks. Research on pattern recognition of this system in art creation is carried out through model training, recommendation performance evaluation, pattern recognition strategy application and regression analysis. The model in this paper works best when the number of nearest neighbors k=15, and the recommendation model in this paper can provide a personalized list of artwork recommendations for different people. The recognition of the system in this paper in the five dimensions of “spiritual level”, “value level”, “philosophical level”, “aesthetic level” and “technical level” is distributed between 4.24\(\mathrm{\sim}\)4.55. The results of regression analysis indicated that the system in this paper can improve the artistic creation as well as pattern recognition.

With development of Internet of Things, big data and artificial intelligence, cell phone signaling data, point-of-interest data and machine learning methods have been widely used in research of various fields of transportation. The use of big data processing techniques and machine learning methods to mine intercity travel data collected by various types of traffic detectors provides a new way of thinking to study travel mode selection behavior. In this paper, we pre-processed cell phone signaling data, geospatial data and interest point data around three aspects: personal attributes, travel attributes and travel mode attributes, and designed intercity travel target group extraction, travel chain extraction, travel mode extraction and travel purpose extraction algorithms, which provide basis for travel feature analysis and travel mode choice behavior prediction modeling.

Conventional techniques to electric power network (EPN) design and management are insufficient to handle extreme weather events like hurricanes due to the growing complexity and fragility of power systems. As a sophisticated simulation and optimization tool, digital twin (DT) technology may offer real-time power infrastructure monitoring and prediction. This study aims to investigate the possible application of digital twin technology in enhancing power system resilience and streamlining the design process, as well as to use it for the 3D design of the full substation engineering infrastructure process. A digital twin-based EPN model that incorporates all of the main components of the power system—power plants, substations, transmission and distribution networks, and customers—is proposed in this paper. Every component of the power system undergoes vulnerability analysis, and the chance of the system failing is calculated using a Bayesian network (BN) model and a parametric vulnerability function. According to modeling projections, Hurricane Ike will cause the majority of consumers’ power supplies to be interrupted. The model predicts that power consumption for residential, commercial, and industrial buildings will be 96.4%, 96.0%, and 94.2%, respectively, depending on the kind of building.

Radar ranging and speed measurement are common applications in daily life, with performance largely dependent on the radar signal processor. However, existing civilian radar signal processors struggle with weak signal reception and low analysis efficiency. This study designs a high-speed radar signal processor based on FPGA architecture, incorporating a fusion processing algorithm to integrate different radar signal bands, enhancing processing efficiency and accuracy. The design includes data feature analysis, storage, and fusion modules. Tests showed that the processor achieved real-time performance with a processing time under 1ms, a ranging error below 1m, and speed measurement accuracy within 5m/s, meeting practical requirements.

Intriguing symmetries are uncovered regarding all magic squares of orders 3, 4, and 5, with 1, 880, and 275,305,224 distinct configurations, respectively. In analogy with the travelling salesman problem, the distributions of the total topological distances of the paths travelled by passing through all the vertices (matrix elements) only once and spanning all elements of the matrix are analyzed. Symmetries are found to characterize the distributions of the total topological distances in these instances. These results raise open questions about the symmetries found in higher-order magic squares and the formulation of their minimum and maximum total path lengths.

In this paper, we introduce the concept of vertex-edge locating Roman dominating functions in graphs. A vertex-edge locating Roman dominating \({(ve-LRD)}\) function of a graph \(G=(V,E)\) is a function \(f:V(G)\rightarrow\{0,1,2\}\) such that the following conditions are satisfied: (i) for every adjacent vertices \(u,v\) with \(f(u)=0\) or \(f(v)=0\), there exists a vertex \(w\) at distance \(1\) or \(2\) from \(u\) or \(v\) with \(f(w)=2\), (ii) for every edge \(uv\in E\), \(\max[f(u),f(v)]\neq 0\), and (iii) any pair of distinct vertices \(u,v\) with \(f(u)=f(v)=0\) does not have a common neighbour \(w\) with \(f(w)=2\). The weight of ve-LRD function is the sum of its function values over all the vertices. The vertex-edge locating Roman domination number of \(G\), denoted by \(\gamma_{veLR}(G)\), is the minimum weight of a {ve-LRD} function in \(G\). We proved that the vertex-edge locating Roman domination problem is NP-complete for bipartite graphs. Also, we present the upper and lower bounds of \({ve-LRD}\) function for trees. Lastly, we give the upper bounds of \({ve-LRD}\) function for some connected graphs.

Traditional personnel recruitment methods are often inefficient and struggle to find candidates who meet job requirements. In this paper, we first develop a comprehensive personnel management system for colleges and universities that streamlines the recruitment process and information management. Next, recruitment data from the system is analyzed using the fuzzy C-means algorithm to cluster applicant profiles and extract position-specific user characteristics. Finally, a joint embedded neural network is employed to match applicant profiles with job positions by optimizing an objective function. Experimental results demonstrate a high job matching rate (up to 98.1%), a significantly reduced recruitment cycle (from job posting to candidate onboarding in 25 days), and a system response time as low as 0.5 seconds. These findings highlight the effectiveness of big data technology in providing timely feedback, reducing recruitment costs and staff workload, and promoting the intelligent development of talent recruitment.

The rapid development of information technology makes intelligent decision support system play an increasingly important role in economic standardized management. The Intelligent Decision Support System (IDSS) constructed in this paper includes interaction layer, analysis layer and data layer. The system standardizes the management of enterprise economy through strategic forecasting and decision analysis, economic planning and control, and economic analysis. The study combines the fuzzy hierarchical analysis method (FAHP) and the fuzzy comprehensive evaluation method (FCE) to evaluate the standardized level of economic management of enterprise A. The evaluation score of the standardized level of enterprise A’s economic management is \(F=80.955\), which is greater than 80, and it belongs to the grade of “good”. It shows that the intelligent decision support system constructed based on this paper can effectively help standardize the management of enterprise economy.

In order to solve the multi-objective optimization problem of resource allocation in enterprise strategic management, the article firstly establishes a multi-objective resource allocation model for maximizing the benefits of enterprises in enterprise strategic management. Then, it optimizes and improves the initial population, convergence factor and dynamic weights of the gray wolf algorithm, increases the population diversity by using the population strategy of reverse learning, improves the convergence factor into a nonlinear factor, and finally changes the decision-making weights of the gray wolf leadership and applies the dynamic weights to improve the accuracy of the algorithm. Subsequently, the improved gray wolf algorithm is utilized for model decoupling. By applying this paper’s algorithm and the other two algorithms to solve the six algorithms 30*6, 60*6, 90*2, 90*4, 150*4 and 150*6 for 9 times, it is found that in the analysis of the 30*6 algorithm, the enterprise’s resource allocation reaches 5,000 when the time is 110 s. At the same time, this paper’s algorithm obtains a better non-dominated solution than the other two algorithms, which proves that this paper’s algorithm solves the multi-objective resource allocation problem of enterprise law industry is proved to be effective.

In food processing, foreign matter inevitably contaminates packaged food. To ensure food safety, ray-based detection is used; however, the original images suffer from aberrations and noise that degrade quality and hinder further processing. Thus, images are preprocessed to enhance quality by highlighting key features and suppressing irrelevant ones before abnormal pattern recognition. Following image segmentation, a BP neural network algorithm is applied for foreign object detection. In tests with contaminants such as metal wires, stones, and glass, the algorithm identified distinct abnormal fluctuations at gray levels of 132, 108, and 34, respectively, allowing it to reliably detect foreign objects. Although the practical detection rate reached 100%, occasional misjudgments suggest that further optimization is needed. Overall, this method introduces a novel approach to detecting foreign objects in food and offers promising new strategies for improving food safety monitoring.

In 2003, the frequency assignment problem in a cellular network motivated Even et al. to introduce a new coloring problem: Conflict-Free coloring. Inspired by this problem and by the Gardner-Bodlaender’s coloring game, in 2020, Chimelli and Dantas introduced the Conflict-Free Closed Neighborhood \(k\)-coloring game (CFCN \(k\)-coloring game). The game starts with an uncolored graph \(G\), \(k\geq 2\) different colors, and two players, Alice and Bob, who alternately color the vertices of \(G\). Both players can start the game and respect the following legal coloring rule: for every vertex \(v\), if the closed neighborhood \(N[v]\) of \(v\) is fully colored then there exists a color that was used only once in \(N[v]\). Alice wins if she ends up with a Conflict-Free Closed Neighborhood \(k\)-coloring of \(G\), otherwise, Bob wins if he prevents it from happening. In this paper, we introduce the game for open neighborhoods, the Conflict-Free Open Neighborhood \(k\)-coloring game (CFON \(k\)-coloring game), and study both games on graph classes determining the least number of colors needed for Alice to win the game.

This paper investigates the number of rooted biloopless nonseparable planar near-triangulations and presents some formulae for such maps with three parameters: the valency of root-face, the number of edges and the number of inner faces. All of them are almost summation-free.

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs without 4-cycles with maximum degree \(\Delta\geq10\).

For a graph \(G=(V,E)\) of size \(q\), a bijection \(f : E \to \{1,2,\ldots,q\}\) is a local antimagic labeling if it induces a vertex labeling \(f^+ : V \to \mathbb{N}\) such that \(f^+(u) \ne f^+(v)\), where \(f^+(u)\) is the sum of all the incident edge label(s) of \(u\), for every edge \(uv \in E(G)\). In this paper, we make use of matrices of fixed sizes to construct several families of infinitely many tripartite graphs with local antimagic chromatic number 3.

An outer independent double Roman dominating function (OIDRDF) of a graph \( G \) is a function \( f:V(G)\rightarrow\{0,1,2,3\} \) satisfying the following conditions:
(i) every vertex \( v \) with \( f(v)=0 \) is adjacent to a vertex assigned 3 or at least two vertices assigned 2;
(ii) every vertex \( v \) with \( f(v)=1 \) has a neighbor assigned 2 or 3;
(iii) no two vertices assigned 0 are adjacent.
The weight of an OIDRDF is the sum of its function values over all vertices, and the outer independent double Roman domination number \( \gamma_{oidR}(G) \) is the minimum weight of an OIDRDF on \( G \). Ahangar et al. [Appl. Math. Comput. 364 (2020) 124617] established that for every tree \( T \) of order \( n \geq 4 \), \( \gamma_{oidR}(T)\leq\frac{5}{4}n \) and posed the question of whether this bound holds for all connected graphs. In this paper, we show that for a unicyclic graph \( G \) of order \( n \), \( \gamma_{oidR}(G) \leq \frac{5n+2}{4} \), and for a bicyclic graph, \( \gamma_{oidR}(G) \leq \frac{5n+4}{4} \). We further characterize the graphs attaining these bounds, providing a negative answer to the question posed by Ahangar et al.

Let \(G\) be a \((p,q)\) graph. Let \(f\) be a function from \(V(G)\) to the set \(\{1,2,\ldots, k\}\) where \(k\) is an integer \(2< k\leq \left|V(G)\right|\). For each edge \(uv\) assign the label \(r\) where \(r\) is the remainder when \(f(u)\) is divided by \(f(v)\) (or) \(f(v)\) is divided by \(f(u)\) according as \(f(u)\geq f(v)\) or \(f(v)\geq f(u)\). \(f\) is called a \(k\)-remainder cordial labeling of \(G\) if \(\left|v_{f}(i)-v_{f}(j)\right|\leq 1\), \(i,j\in \{1,\ldots , k\}\) where \(v_{f}(x)\) denote the number of vertices labeled with \(x\) and \(\left|\eta_{e}(0)-\eta_{o}(1)\right|\leq 1\) where \(\eta_{e}(0)\) and \(\eta_{o}(1)\) respectively denote the number of edges labeled with even integers and number of edges labeled with odd integers. A graph with admits a \(k\)-remainder cordial labeling is called a \(k\)-remainder cordial graph. In this paper we investigate the \(4\)-remainder cordial labeling behavior of Prism, Crossed prism graph, Web graph, Triangular snake, \(L_{n} \odot mK_{1}\), Durer graph, Dragon graph.

Given a connected graph \(H\), its first Zagreb index \(M_{1}(H)\) is equal to the sum of squares of the degrees of all vertices in \(H\). In this paper, we give a best possible lower bound on \(M_{1}(H)\) that guarantees \(H\) is \(\tau\)-path-coverable and \(\tau\)-edge-Hamiltonian, respectively. Our research supplies a continuation of the results presented by Feng et al. (2017).

The degree of an edge \(uv\) of a graph \(G\) is \(d_G(u)+d_G(v)-2.\) The degree associated edge reconstruction number of a graph \(G\) (or dern(G)) is the minimum number of degree associated edge-deleted subgraphs that uniquely determines \(G.\) Graphs whose vertices all have one of two possible degrees \(d\) and \(d+1\) are called \((d,d+1)\)-bidegreed graphs. It was proved, in a sequence of two papers [1,17], that \(dern(mK_{1,3})=4\) for \(m>1,\) \(dern(mK_{2,3})=dern(rP_3)=3\) for \(m>0, ~r>1\) and \(dern(G)=1\) or \(2\) for all other bidegreed graphs \(G\) except the \((d,d+1)\)-bidegreed graphs in which a vertex of degree \(d+1\) is adjacent to at least two vertices of degree \(d.\) In this paper, we prove that \(dern(G)= 1\) or \(2\) for this exceptional bidegreed graphs \(G.\) Thus, \(dern(G)\leq 4\) for all bidegreed graphs \(G.\)