In recent years, there is a lot of interest in the topic of conveying the groups of planar graphs with an unvarying metric dimension. A few types of planar graphs have recently had their locating number (or metric dimension) determined, and an outstanding problem concerning these graphs was brought up that: Illustrate the types of planar graphs $\mathrm{{\rm Y}}$ that can be generated from a graph $\mathrm{\Phi }$ through the addition of more edges to $\mathrm{\Phi }$, such that $dim(\mathrm{\Phi })=dim(\mathrm{{\rm Y}})$ and $\mathbb{V}(\mathrm{\Phi })=\mathbb{V}(\mathrm{{\rm Y}})$. While proceeding in a similar directives, we identify two families of radially identical planar graphs with unaltered metric dimension in this study: ${ϝ}_{n,m}$ and ${\gimel }_{n,m}$. We do this by establishing that $dim({ϝ}_{n,m})=dim({\gimel }_{n,m})$ and $\mathbb{V}({ϝ}_{n,m})=\mathbb{V}({\gimel }_{n,m})$, respectively. We acquire another family of a radially symmetrical plane graph (i.e., ${\daleth }_{n,m}$) with a constant metric dimension. We show that all the vertices of these classes of the plane graphs can potentially be identified with just three well-chosen nodes.

The purpose of this work was to use machine learning classification models and hyperspectral camera technologies to create a model of surface damage to garlic. 140 of the 184 garlic plants of which 44 were used for test validation were pre-treated for surface damage. First, we examined the data in ENVI under various damage scenarios using the normalised vegetation index (NDVI) approach. 579 pixels were then chosen for the training of the logistic regression model. Finally, we used 54 garlic bulbs to practically validate the model. Although tiny regions could not be precisely identified, the mouldy portion of the garlic’s surface could be identified using the NDVI technique. 90% accuracy was attained using the 90% classification model constructed using the logistic regression approach. Garlic’s surface damage, even at first mild ones, was correctly identified. The creation of this model for identifying garlic damage lowers the cost of detecting garlic damage and broadens the use of hyperspectral technologies in garlic detection.

In this paper, the sensor is applied to the collection of rock parameter data. Aiming at the classification and evaluation of stability (i.e. rock quality), an attribute recognition model for the classification and evaluation of surrounding rock quality of underground engineering is established. Using multi-source data fusion and orthogonal numerical simulation test methods, the effects of rock mechanics parameters on the horizontal convergence of the tunnel, the settlement of the vault and the plastic zone coefficient are studied. Six factors (elastic modulus, Poisson’s ratio, internal friction angle, tensile strength, cohesion and density) and three levels of orthogonal experimental solutions were selected. The method of defining similar weight by using similar number to determine the weight of evaluation index, so as to calculate the comprehensive attribute measure, and apply confidence criteria to identify the stability of rock samples. Through the analysis and evaluation of rock mass quality classification of underground engineering, the application of the model and the evaluation method of rock mass quality classification are explained. The test results match the orthogonal test results; Considering the stability of tunnel envelope, the horizontal convergence, vault settlement and plastic zone coefficient after excavation should be comprehensively considered.

This paper proposes a comprehensive framework for testing and evaluating automatic ambulances, crucial for ensuring their reliability and safety in real-world scenarios. The framework includes designing test scenarios with varying complexity, covering environmental factors like road conditions, weather, and obstacles. An evaluation index system is introduced, comprising driving security, ride comfort, intelligence, and efficiency. Methodologies for calculating indicator weights, using the CRITIC and AHP methods, are presented to ensure fair evaluation. Additionally, evaluation methods including qualitative and quantitative techniques, such as grey correlation theory, are discussed. The test results show that the assessment results of the traditional fuzzy comprehensive evaluation method and the grey correlation theory evaluation method are highly consistent. The change in vehicle speed has less of an effect on accuracy during the real-time assessment process when the time interval is set to 0.1s, and the evaluation time of 0.098s can satisfy the requirement that the planning time of autonomous driving vehicles be shorter than 200 ms.

In recent years, the use of smart data analysis method to predict the stock price is financial technology; important issues in the field of finch. However, there are many technical indicators and human subjective factors will affect the stock price forecast, so we must effectively grasp the important influence indicators to improve the accuracy of stock price forecast. Therefore, this study uses four machine learning algorithms to predict and analyze the stock price fluctuation through the screening process of technical indicators, and then selects the important technical indicators. In addition, due to the uncertainty and fuzziness of the attributes of technical indicators and human subjective judgment, this study uses the fuzzy inference method to construct the fuzzy inference system to predict the rise and fall of stock price, and proposes the prediction method of the range of the rise and fall of stock price. Finally, this paper makes an empirical analysis on the stock price data of three companies. The results show that the accuracy of stock price forecast is more than 82.13%, and the average accuracy of stock price forecast is more than 83%. Therefore, the fuzzy inference prediction system proposed in this study not only has the theoretical basis, but also can effectively predict the trend and range of stock price, which has practical value and contribution to investors.

Removing clouds is an essential preprocessing step in analyzing remote sensing images, as cloud-based overlays commonly occur in optical remote sensing images and can significantly limit the usability of the acquired data. Deep learning has exhibited remarkable progress in remote sensing, encompassing scene classification and change detection tasks. Nevertheless, the appli-cation of deep learning techniques to cloud removal in remote sensing images is currently con-strained by the limited availability of training datasets explicitly tailored for neural networks. This paper presents the Remote sensing Image Cloud rEmoving dataset (RICE) to address this challenge and proposes baseline models incorporating a convolutional attention mechanism, which has demonstrated superior performance in identifying and restoring cloud-affected regions, with quantitative results indicating a 3.08% improvement in accuracy over traditional methods. This mechanism empowers the network to comprehend better the spatial structure, local details, and inter-channel correlations within remote sensing images, thus effectively addressing the diverse distributions of clouds. Moreover, by integrating this attention mechanism, our models achieve a crucial comparison advantage, outperforming existing state-of-the-art techniques in terms of both visual quality and quantitative metrics. We propose adopting the Learned Per-ceptual Image Patch Similarity metric, which emphasizes perceptual similarity, to evaluate the quality of cloud-free images generated by the models. Our work not only contributes to advancing cloud removal techniques in remote sensing but also provides a comprehensive evaluation framework for assessing the fidelity of the generated images.

Let $g,f:V(G)\to \{0,1,2,3,\cdots \}$ be two functions satisfying $g(x)\le f(x)$ for every $x\in V(G)$. A $(g,f)$-factor of $G$ is
defined as a spanning subgraph $F$ of $G$ such that $g(x)\le d_F(x)\le f(x)$ for every $x\in V(G)$. An $(f,f)$-factor is simply called
an $f$-factor. Let $\phi$ be a nonnegative integer-valued function defined on $V(G)$. Set
$$D_{g,f}^{even}=\{\phi :g(x)\le \phi (x)\le f(x)\text{ for every }x\in V(G)\text{ and }\sum _{x\in V(G)}\phi (x)\text{ is even}\}.$$
If for each $\phi \in D_{g,f}^{even}$, $G$ admits a $\phi$-factor, then we say that $G$ admits all $(g,f)$-factors. All $(g,f)$-factors
are said to be all $[1,k]$-factors if $g(x)\equiv 1$ and $f(x)\equiv k$ for any $x\in V(G)$. In this paper, we verify that for a connected multigraph
$G$ satisfying $N_G(X)=V(G)\text{ or }|N_G(X)|>(1+\frac{1}{k+1})|X|-1$ for every $X\subset V(G)$, $kG$ admits all $[1,k]$-factors, where
$k\ge 2$ is an integer and $kG$ denotes the graph derived from $G$ by replacing every edge of $G$ with $k$ parallel edges.

We consider finitely presented groups $G_{mn}$ as follows:
$$G_{mn}=⟨x,y\mid x^m=y^n=1,[x,y{]}^x=[x,y],[x,y{]}^y=[x,y]⟩m,n\ge 2.$$
In this paper, we first study the groups $G_{mn}$. Then by using the properties of $G_{mm}$ and $t-$Fibonacci sequences in
finitely generated groups, we show that the period of $t-$Fibonacci sequences in $G_{mm}$ are a multiple of $K(t,m)$. In particular for $t\ge 3$ and $p=2$, we prove ${LEN}_t(G_{pp})=2K(t,p)$.

In this paper, we consider a degree sum condition sufficient to imply the existence of $k$ vertex-disjoint chorded cycles in a graph $G$.
Let ${\sigma }_4(G)$ be the minimum degree sum of four independent vertices of $G$.
We prove that if $G$ is a graph of order at least $11k+7$ and ${\sigma }_4(G)\ge 12k-3$ with $k\ge 1$,
then $G$ contains $k$ vertex-disjoint chorded cycles.
We also show that the degree sum condition on ${\sigma }_4(G)$ is sharp.

This study addresses challenges in rural planning amid economic growth and the implementation of rural revitalization policies. The aim is to enhance the integration of cultural and ecological elements in rural areas, combating issues such as the fading village atmosphere and incomplete agricultural chains. The research focuses on optimizing the random forest algorithm to explore innovative approaches to landscape planning and design for rural human settlements. Using the moving window method, the study computes two-dimensional and three-dimensional landscape indices in surrounding villages of Beijing, conducting a multi-scale analysis of the living environment. Power function fitting indicates an optimal window size of approximately 700 meters for studying the relationship between art patterns and three-dimensional landscape patterns in the rural area. The findings offer insights into improving rural living environments through effective landscape planning and design influenced by artistic modes.

In the major cities with many high-rise buildings in contemporary China, land resources are becoming more and more scarce, and the urban ecological environment is in urgent need of recycling, and due to the blind imitation of Western culture and design mode and the neglect of China traditional regional culture, the urban landscape lacks interaction, resonance, and sense of belonging with citizens, and the phenomenon of landscape similarity emerges in various cities, focusing on the landscape space of urban complexes. There are also these problems. Urban residents urgently need a third space that can adjust their physical, mental, and spiritual needs. How to design an urban complex landscape that meets the aesthetic needs and humanistic needs of contemporary cities and has regional characteristics has become the first important task of my research. Folk art is an artistic treasure created by the working people in their production and life. Folk art is the embodiment of cultural regionality and the foundation of national culture. It awakens people’s awareness of the importance of local culture, awakens people’s sense of belonging, and is closer to the local public life. Today, the living soil and social and humanistic environment of folk art are in the process of urbanization in China, and there is a trend of gradual disappearance of lifestyle changes. How to make the contemporary urban complex landscape an organic soil for the survival, expression, application, and development of folk art is an important task in contemporary urban landscape design. Based on optimization, related concepts such as symbols, folk art symbols, urban complexes, urban complex landscape design, etc. have been sorted out. The relevant experimental results show that the construction land accuracy of the logistic regression model based on genetic algorithm has increased from 78.0% to 85.3%. kappa increased from 74.5% to 81.2%. Research shows that the logistic regression parameter optimization method based on genetic algorithm has better simulation effect than the conventional logistic regression method and is more suitable for the situation of unbalanced data distribution and many data features in the simulation of large-scale urban land dynamic changes.

Digital services, including healthcare, among others, have recently seen a massive volume of complicated data that arrives rapidly due to a rapid increase in the number of smart devices, focusing on the needs of regional emerging economic development and industrial structure adjustment, this paper explores the dynamic adjustment of a major in which schools, governments, enterprises and international cooperation participate in the development of regional emerging economies. mechanism. Based on the concept of future-oriented development, formulate a development plan for the legal profession, build a community of government, school, enterprise and international cooperation, promote the vigorous implementation of engineering practice education, and cultivate high-quality, high-level, international graduates, and to form the school-running characteristics of law majors in local application-oriented undergraduate colleges.

Given a connected simple undirected graph $G=(V,E)$, a subset $S$ of $V$ is $P_3$-convex if each vertex of $G$ not in $S$ has at most one neighbor in $S$. The $P_3$-convex hull $⟨S⟩$ of $S$ is the smallest $P_3$-convex set containing $S$. A Carathéodory set of $G$ is a set $S\subseteq V$ such that $⟨S⟩\setminus \bigcup _{w\in S}⟨S\setminus \{w\}⟩$ is non-empty. The Carathéodory number of $G$, denoted by $C(G)$, is the largest cardinality of a Carathéodory set of $G$. In this paper, we settle the conjecture posed by Barbosa et al. appeared in [SIAM J. Discrete Math. 26 (2012) 929–939] in the affirmative, which states that for a claw-free graph $G$ of order $n(G)$, the Carathéodory number $C(G)$ of the $P_3$-convexity satisfies $C(G)\le \frac{2n(G)+6}{5}$. Furthermore, we determine all graphs attaining the bound.

The key factor that promotes Vocational students development is the development of movement, which requires children to have excellent motor skills to develop their intellectual level, physical function and social adaptability in daily study and life. Data mining technology is an economical and practical core technology, which obtains useful information for the service system from a large amount of data. However, many teaching deficiencies in this area are prevalent in the field of early childhood education. In the current research on the content of Vocational students physical activities, a large amount of data information needs the support of data mining technology. This paper aims at how to combine data mining technology to study the content of Vocational students sports activities from the perspective of movement development, establish a decision support system for Vocational students sports activities, and conduct experiments on Vocational students sports activities from the perspective of action scientific arrangement and implementation of activity content, carry out empirical research on the content of Vocational students sports activities.

When using airborne LiDAR point clouds for city modelling and road extraction, point cloud classification is a crucial step. There are numerous ways for classifying point clouds, but there are still issues like redundant multi-dimensional feature vector data and poor point cloud classification in intricate situations. A point cloud classification method built on the fusing of multikernel feature vectors is suggested as a solution to these issues. The technique employs random forest to classify point cloud data by merging colour information, and it extracts feature vectors based on point primitives and object primitives, respectively. In this study, a densely populated area was chosen as the study area. Light airborne LIDAR mounted on a delta wing was used to collect point cloud data at a low altitude (170 m) over a dense cross-course. The point cloud data were then combined, corrected, and enhanced with texture data, and the houses were vectorized on the point cloud. The accuracy of the results was then assessed. With a median inaccuracy of 4.8 cm and a point cloud data collection rate of 83.3%, using airborne LIDAR to measure house corners can significantly lighten the labour associated with external house corner measurements.This test extracts the texture information of point cloud data through the efficient processing of high-density point cloud data, providing a reference for the application of texture information of airborne LIDAR data and a clear understanding of its accuracy.

One of the fundamental properties of the hypercube $Q_n$ is that it is bipancyclic as $Q_n$ has a cycle of length $l$ for every even integer $l$ with $4\le l\le 2^n$. We consider the following problem of generalizing this property: For a given integer $k$ with $3\le k\le n$, determine all integers $l$ for which there exists an $l$-vertex, $k$-regular subgraph of $Q_n$ that is both $k$-connected and bipancyclic. The solution to this problem is known for $k=3$ and $k=4$. In this paper, we solve the problem for $k=5$. We prove that $Q_n$ contains a $5$-regular subgraph on $l$ vertices that is both $5$-connected and bipancyclic if and only if $l\in \{32,48\}$ or $l$ is an even integer satisfying $52\le l\le 2^n$. For general $k$, we establish that every $k$-regular subgraph of $Q_n$ has $2^k,2^k+2^{k-1}$ or at least $2^k+2^{k-1}+2^{k-3}$ vertices.

Coded caching technology can better alleviate network traffic congestion. Since many of the centralized coded caching schemes now in use have high subpacketization, which makes scheme implementation more challenging, coded caching schemes with low subpacketization offer a wider range of practical applications. It has been demonstrated that the coded caching scheme can be achieved by creating a combinatorial structure named placement delivery array (PDA). In this work, we employ vector space over a finite field to obtain a class of PDA, calculate its parameters, and consequently achieve a coded caching scheme with low subpacketization. Subsequently, we acquire a new MN scheme and compare it with the new scheme developed in this study. The subpacketization $F$ of the new scheme has significant advantages. Lastly, the number of users $K$, cache fraction $\frac{M}{N}$, and subpacketization $F$ have advantages to some extent at the expense of partial transmission rate $R$ when compared to the coded caching scheme in other articles.

We continue the study of Token Sliding (reconfiguration) graphs of independent sets initiated by the authors in an earlier paper [Graphs Comb. 39.3, 59, 2023]. Two of the topics in that paper were to study which graphs $G$ are Token Sliding graphs and which properties of a graph are inherited by a Token Sliding graph. In this paper, we continue this study specializing in the case of when $G$ and/or its Token Sliding graph ${\mathsf{T}\mathsf{S}}_k(G)$ is a tree or forest, where $k$ is the size of the independent sets considered. We consider two problems. The first is to find necessary and sufficient conditions on $G$ for ${\mathsf{T}\mathsf{S}}_k(G)$ to be a forest. The second is to find necessary and sufficient conditions for a tree or forest to be a Token Sliding graph. For the first problem, we give a forbidden subgraph characterization for the cases of $k=2,3$. For the second problem, we show that for every $k$-ary tree $T$ there is a graph $G$ for which ${\mathsf{T}\mathsf{S}}_{k+1}(G)$ is isomorphic to $T$. A number of other results are given along with a join operation that aids in the construction of ${\mathsf{T}\mathsf{S}}_k$-graphs.

In this paper, we introduce graceful and near graceful labellings of several families of windmills. In particular, we use Skolem-type sequences to prove (near) graceful labellings exist for windmills with $C_3$ and $C_4$ vanes, and infinite families of $3,5$-windmills and $3,6$-windmills. Furthermore, we offer a new solution showing that the graph obtained from the union of $t$ 5-cycles with one vertex in common ($C_5^t$) is graceful if and only if $t\equiv 0,3(\mathrm{mod}4)$ and near graceful when $t\equiv 1,2(\mathrm{mod}4)$.

We study groups generated by sets of pattern avoiding permutations. In the first part of the paper, we prove some general results concerning the structure of such groups. In particular, we consider the sequence $(G_n{)}_{n\ge 0}$, where $G_n$ is the group generated by a subset of the symmetric group $S_n$ consisting of permutations that avoid a given set of patterns. We analyze under which conditions the sequence $(G_n{)}_{n\ge 0}$ is eventually constant. Moreover, we find a set of patterns such that $(G_n{)}_{n\ge 0}$ is eventually equal to an assigned symmetric group. Furthermore, we show that any non-trivial simple group cannot be obtained in this way and describe all the non-trivial abelian groups that arise in this way. In the second part of the paper, we carry out a case-by-case analysis of groups generated by permutations avoiding a few short patterns.

We consider the eccentric graph of a graph $G$, denoted by $\mathrm{e}\mathrm{c}\mathrm{c}(G)$, which has the same vertex set as $G$, and two vertices in the eccentric graph are adjacent if and only if their distance in $G$ is equal to the eccentricity of one of them. In this paper, we present a fundamental requirement for the isomorphism between $\mathrm{e}\mathrm{c}\mathrm{c}(G)$ and the complement of $G$, and show that the previous necessary condition given in the literature is inadequate. Also, we obtain that the diameter of $\mathrm{e}\mathrm{c}\mathrm{c}(T)$ is at most 3 for any tree and get some characterizations of the eccentric graph of trees.

Let $G$ be a finite simple undirected $(p,q)$-graph, with vertex set $V(G)$ and edge set $E(G)$ such that $p=|V(G)|$ and $q=|E(G)|$. A super edge-magic total labeling $f$ of $G$ is a bijection $f:V(G)\cup E(G)⟶\{1,2,\dots ,p+q\}$ such that for all edges $uv\in E(G)$, $f(u)+f(v)+f(uv)=c(f)$, where $c(f)$ is called a magic constant, and $f(V(G))=\{1,\dots ,p\}$. The minimum of all $c(f)$, where the minimum is taken over all the super edge-magic total labelings $f$ of $G$, is defined to be the super edge-magic total strength of the graph $G$. In this article, we work on certain classes of unicyclic graphs and provide evidence to conjecture that the super edge-magic total strength of a certain family of unicyclic $(p,q)$-graphs is equal to $2q+\frac{n+3}{2}$.

For a poset $P=C_a\times C_b$, a subset $A\subseteq P$ is called a chain blocker for $P$ if $A$ is inclusion-wise minimal with the property that every maximal chain in $P$ contains at least one element of $A$, where $C_i$ is the chain $1<\cdots <i$. In this article, we define the shelter of the poset $P$ to give a complete description of all chain blockers of $C_5\times C_b$ for $b\ge 1$.

This project aims at investigating properties of channel detecting codes on specific domains $1^{+}{0}^{+}$. We focus on the transmission channel with deletion errors. Firstly, we discuss properties of channels with deletion errors. We propose a certain kind of code that is a channel detecting (abbr. $\gamma$-detecting) code for the channel $\gamma =\delta (m,N)$ where $m<N$. The characteristic of this $\gamma$-detecting code is considered. One method is provided to construct $\gamma$-detecting code. Finally, we also study a kind of special channel code named $\tau (m,N)$-srp code.

A chemical structure specifies the molecular geometry of a given molecule or solid in the form of atom arrangements. One way to analyze its properties is to simulate its formation as a product of two or more simpler graphs. In this article, we take this idea to find upper and lower bounds for the generalized Randić index ${\mathcal{R}}_{\alpha }$ of four types of graph products, using combinatorial inequalities. We finish this paper by providing the bounds for ${\mathcal{R}}_{\alpha }$ of a line graph and rooted product of graphs.

Let $G$ be a $(p,q)$ graph. Let $f:V(G)\to \{1,2,\dots ,k\}$ be a map where $k\in \mathbb{N}$ is a variable and $k>1$. For each edge $uv$, assign the label $gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if $|t_f(i)–t_f(j)|\le 1$, $i,j\in \{1,2,\dots ,k\}$ where $t_f(x)$ denotes the total number of vertices and edges labeled with $x$. A graph with a $k$-total prime cordial labeling is called $k$-total prime cordial graph. In this paper, we investigate the 4-total prime cordial labeling of some graphs like dragon, Möbius ladder, and corona of some graphs.

Let $G=(V,E)$ be a graph with vertex set $V$ and edge set $E$. An edge labeling $f:E\to Z_2$ induces a vertex labeling $f^{+}:V\to Z_2$ defined by $f^{+}(v)\equiv \sum _{uv\in E}f(uv)(\mathrm{mod}2)$, for each vertex $v\in V$. For $i\in Z_2$, let $v_f(i)=|\{v\in V:f^{+}(v)=i\}|$ and $e_f(i)=|\{e\in E:f(e)=i\}|$. An edge labeling $f$ of a graph $G$ is said to be edge-friendly if $|e_f(1)–e_f(0)|\le 1$. The set $\{v_f(1)–v_f(0):f\text{ is an edge-friendly labeling of }G\}$ is called the full edge-friendly index set of $G$. In this paper, we shall determine the full edge-friendly index sets of one point union of cycles.

After the Chartrand definition of graph labeling, since 1988 many graph families have been labeled through mathematical techniques. A basic approach in those labelings was to find a pattern among the labels and then prove them using sequences and series formulae. In 2018, Asim applied computer-based algorithms to overcome this limitation and label such families where mathematical solutions were either not available or the solution was not optimum. Asim et al. in 2018 introduced the algorithmic solution in the area of edge irregular labeling for computing a better upper-bound of the complete graph $es(K_n)$ and a tight upper-bound for the complete $m$-ary tree ${es(T}_{m,h})$ using computer-based experiments. Later on, more problems like complete bipartite and circulant graphs were solved using the same technique. Algorithmic solutions opened a new horizon for researchers to customize these algorithms for other types of labeling and for more complex graphs. In this article, to compute edge irregular $k$-labeling of star $S_{m,n}$ and banana tree ${BT}_{m,n}$, new algorithms are designed, and results are obtained by executing them on computers. To validate the results of computer-based experiments with mathematical theorems, inductive reasoning is adopted. Tabulated results are analyzed using the law of double inequality and it is concluded that both families of trees observe the property of edge irregularity strength and are tight for $\lceil \frac{|V|}{2}\rceil$-labeling.

A graph $G$ is called a fractional ID-$(g,f)$-factor-critical covered graph if for any independent set $I$ of $G$ and for every edge $e\in E(G-I)$, $G-I$ has a fractional $(g,f)$-factor $h$ such that $h(e)=1$. We give a sufficient condition using degree condition for a graph to be a fractional ID-$(g,f)$-factor-critical covered graph. Our main result is an extension of Zhou, Bian, and Wu’s previous result [S. Zhou, Q. Bian, J. Wu, A result on fractional ID-$k$-factor-critical graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 87(2013) 229–236] and Yashima’s previous result [T. Yashima, A degree condition for graphs to be fractional ID-$[a,b]$-factor-critical, Australasian Journal of Combinatorics 65(2016) 191–199].

In this article, we define $q$-generalized Fibonacci polynomials and $q$-generalized Lucas polynomials using $q$-binomial coefficient and obtain their recursive properties. In addition, we introduce generalized $q$-Fibonacci matrix and generalized $q$-Lucas matrix, then we derive their basic identities. We define $(k,q,t)$-symmetric generalized Fibonacci matrix and $(k,q,t)$-symmetric generalized Lucas matrix, then we give the Cholesky factorization of these matrices. Finally, we give determinantal and permanental representations of these new polynomial sequences.

Stanley considered Dyck paths where each maximal run of down-steps to the $x$-axis has odd length; they are also enumerated by (shifted) Catalan numbers. Prefixes of these combinatorial objects are enumerated using the kernel method. A more challenging version of skew Dyck paths combined with Stanley’s restriction is also considered.

For $r=1,2,\dots ,6$, we obtain generating functions $F_k^{(r)}(y)$ for words over the alphabet $[k]$, where $y$ tracks the number of parts and $[y^n]$ is the total number of distinct adjacent $r$-tuples in words with $n$ parts. In order to develop these generating functions for $1\le r\le 3$, we make use of intuitive decompositions but for larger values of $r$, we switch to the cluster analysis method for decorated texts that was introduced by Bassino et al. Finally, we account for the coefficients of these generating functions in terms of Stirling set numbers. This is done by putting forward the full triangle of coefficients for all the sub-cases where $r=5$ and 6. This latter is shown to depend on both periodicity and number of letters used in the $r$-tuples.

We consider the following variant of the round-robin scheduling problem: $2n$ people play a number of rounds in which two opposing teams of $n$ players are reassembled in each round. Each two players should play at least once in the same team, and each two players should play at least once in opposing teams. We provide an explicit formula for calculating the minimal numbers of rounds needed to satisfy both conditions. Moreover, we also show how one can construct the corresponding playing schedules.

Two binary structures $\mathfrak{R}$ and ${\mathfrak{R}}^{\prime }$ on the same vertex set $V$ are $(\le k)$-hypomorphic for a positive integer $k$ if, for every set $K$ of at most $k$ vertices, the two binary structures induced by $\mathfrak{R}$ and ${\mathfrak{R}}^{\prime }$ on $K$ are isomorphic. A binary structure $\mathfrak{R}$ is $(\le k)$-reconstructible if every binary
structure ${\mathfrak{R}}^{\prime }$ that is $(\le k)$-hypomorphic to $\mathfrak{R}$ is isomorphic to $\mathfrak{R}$. In this paper, we describe the pairs of $(\le 3)$-hypomorphic posets and the pairs of $(\le 3)$-hypomorphic bichains. As a consequence, we characterize the $(\le 3)$-reconstructible posets and the $(\le 3)$-reconstructible bichains. This answers a question suggested by Y. Boudabbous and C. Delhommé during a personal communication.

A tremendous amount of drug experiments revealed that there exists a strong inherent relation between the molecular structures of drugs and their biomedical and pharmacology characteristics. Due to the effectiveness for pharmaceutical and medical scientists of their ability to grasp the biological and chemical characteristics of new drugs, analysis of the bond incident degree (BID) indices is significant of testing the chemical and pharmacological characteristics of drug molecular structures that can make up the defects of chemical and medicine experiments and can provide the theoretical basis for the manufacturing of drugs in pharmaceutical engineering. Such tricks are widely welcomed in developing areas where enough money is lacked to afford sufficient equipment, relevant chemical reagents, and human resources which are required to investigate the performance and the side effects of existing new drugs. This work is devoted to establishing a general expression for calculating the bond incident degree (BID) indices of the line graphs of various well-known chemical structures in drugs, based on the drug molecular structure analysis and edge dividing technique, which is quite common in drug molecular graphs.

In this paper, we introduce a graph structure, called component intersection graph, on a finite dimensional vector space $\mathbb{V}$. The connectivity, diameter, maximal independent sets, clique number, chromatic number of component intersection graph have been studied.

A linear system is a pair $(P,\mathcal{L})$ where $\mathcal{L}$ is a finite family of subsets on a finite ground set $P$ such that any two subsets of $\mathcal{L}$ share at most one element. Furthermore, if for every two subsets of $\mathcal{L}$ share exactly one element, the linear system is called intersecting. A linear system $(P,\mathcal{L})$ has rank $r$ if the maximum size of any element of $\mathcal{L}$ is $r$. By $\gamma (P,\mathcal{L})$ and ${\nu }_2(P,\mathcal{L})$ we denote the size of the minimum dominating set and the maximum 2-packing of a linear system $(P,\mathcal{L})$, respectively. It is known that any intersecting linear system $(P,\mathcal{L})$ of rank $r$ is such that $\gamma (P,\mathcal{L})\le r-1$. Li et al. in [S. Li, L. Kang, E. Shan and Y. Dong, The finite projective plane and the 5-Uniform linear intersecting hypergraphs with domination number four, Graphs and 34 Combinatorics (2018) , no.~5, 931–945.] proved that every intersecting linear system of rank 5 satisfying $\gamma (P,\mathcal{L})=4$ can be constructed from a 4-uniform intersecting linear subsystem $(P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})$ of the projective plane of order 3 satisfying $\tau (P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})={\nu }_2(P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})=4$, where $\tau (P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})$ is the transversal number of $(P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})$. In this paper, we give an alternative proof of this result given by Li et al., giving a complete characterization of these 4-uniform intersecting linear subsystems. Moreover, we prove a general case, that is, we prove if $q$ is an odd prime power and $(P,\mathcal{L})$ is an intersecting linear system of rank $(q+2)$ satisfying $\gamma (P,\mathcal{L})=q+1$, then this linear system can be constructed from a spanning $(q+1)$-uniform intersecting linear subsystem $(P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})$ of the projective plane of order $q$ satisfying $\tau (P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})={\nu }_2(P^{\mathrm{\prime }},{\mathcal{L}}^{\mathrm{\prime }})=q+1$.

We classify all near hexagons of order $(3,t)$ that contain a big quad. We show that, up to isomorphism, there are ten such near hexagons.

Let $G=(V,E)$ be a simple graph. A vertex $v\in V(G)$ ve-dominates every edge $uv$ incident to $v$, as well as every edge adjacent to these incident edges. A set
$D\subseteq V(G)$ is a vertex-edge dominating set if every edge of $E(G)$ is ve-dominated by a vertex of $D.$ The MINIMUM VERTEX-EDGE DOMINATION problem is to find a vertex-edge dominating set of minimum cardinality. A linear time algorithm to find the minimum vertex-edge dominating set for proper interval graphs is proposed. The vertex-edge domination problem is proved to be APX-complete for bounded-free graphs and NP-Complete for Chordal bipartite and Undirected Path graphs.