Soil suction is one of the most important parameters describing the moisture condition of unsaturated soils. The measurement of soil suction is crucial for applying the theories of the engineering behavior of unsaturated soils.
The filter paper method is one of the soil suction measurement techniques In this paper, five soil samples were collected from five sites within Baghdad city – al-Rasafa region. These soils have different properties and they were prepared at different degrees of saturation. For each sample, the total and matric suction were measured by the filter paper method at different degrees of saturation. Then correlations were made between the soil properties and the total and matric suction. It was concluded that the

Let G be a finite group, the result is the involution graph of G, which is an undirected simple graph denoted by the group G as the vertex set and x, y ∈ G adjacent if xy and (xy)2 = 1. In this article, we investigate certain properties of G, the Leech lattice groups HS and McL. The study involves calculating the diameter, the radius, and the girth of ΓGRI.

Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f

In this work, we study several features of the non-zero divisor graphs (ℵZD- graph) for the ring Zn of integer modulo n. For instance, the clique number, radius, girth, domination number, and the local clustering coefficient are determined. Furthermore, we present an algorithm that calculates the clique number and draws the non-zero divisor for the ring Zn.

Abstract Background: Timely diagnosis of periodontal disease is crucial for restoring healthy periodontal tissue and improving patients’ prognosis. There is a growing interest in using salivary biomarkers as a noninvasive screening tool for periodontal disease. This study aimed to investigate the diagnostic efficacy of two salivary biomarkers, lactate dehydrogenase (LDH) and total protein, for periodontal disease by assessing their sensitivity in relation to clinical periodontal parameters. Furthermore, the study aimed to explore the impact of systemic disease, age, and sex on the accuracy of these biomarkers in the diagnosis of periodontal health. Materials and methods: A total of 145 participants were categorized into three groups based

Let G be a graph with p vertices and q edges and  be an injective function, where k is a positive integer. If the induced edge labeling   defined by for each is a bijection, then the labeling f is called an odd Fibonacci edge irregular labeling of G. A graph which admits an odd Fibonacci edge irregular labeling is called an odd Fibonacci edge irregular graph. The odd Fibonacci edge irregularity strength ofes(G) is the minimum k for which G admits an odd Fibonacci edge irregular labeling. In this paper, the odd Fibonacci edge irregularity strength for some subdivision graphs and graphs obtained from vertex identification is determined.

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.