An anatomical study was carried out at the College of Agricultural Engineering Sciences, University of Baghdad, in 2017, on lupine crop (Lupinus albus) as a comparison guide of three seed weights of three lupine cultivars viz. ‘Giza-1’, ‘Giza-2’ and ‘Hamburg’. The nested design was used with four replications. The results showed that cultivars had a significant effect on stem anatomical traits. ‘Hamburg’ cultivar recorded the highest stem diameter, cortex thickness and xylem vascular diameter, while cultivar ‘Giza-1’ recorded the lowest values for the same traits as well as the highest collenchyma layer thickness, vascular bundle thickness, and xylem thickness. Cultivar ‘Giza-2’ recorded the lowest vascular bundle th

In this manuscript, the effect of substituting strontium with barium on the structural properties of Tl_0.8Ni_0.2Sr_2-xBr_xCa₂Cu₃O_9-δcompound with x= 0, 0.2, 0.4, have been studied. Samples were prepared using solid state reaction technique, suitable oxides alternatives of Pb₂O₃, CaO, BaO and CuO with 99.99% purity as raw materials and then mixed. They were prepared in the form of discs with a diameter of 1.5 cm and a thickness of (0.2-0.3) cm under pressures 7 tons / cm², and the samples were sintered at a constant temperature o

      In this Ë‘work, we present theË‘ notion of the Ë‘graph for a KU-semigroup  as theË‘undirected simple graphË‘ with the vertices are the elementsË‘ of  and weË‘Ë‘study the Ë‘graph ofË‘ equivalence classesË‘ofË‘  which is determinedË‘ by theË‘ definition equivalenceË‘ relation ofË‘ these verticesË‘, andË‘ then some related Ë‘properties areË‘ given. Several examples are presented and some theorems are proved. ByË‘ usingË‘ the definitionË‘ ofË‘ isomorphicË‘ graph, Ë‘we showË‘ thatË‘ the graphË‘ of equivalence Ë‘classes Ë‘and the Ë‘graphË‘of Ë‘a KU-semigroup Ë‘  areË‘ theË‘ sameË‘,

In this paper, the concept of semi-?-open set will be used to define a new kind of strongly connectedness on a topological subspace namely "semi-?-connectedness". Moreover, we prove that semi-?-connectedness property is a topological property and give an example to show that semi-?-connectedness property is not a hereditary property. Also, we prove thate semi-?-irresolute image of a semi-?-connected space is a semi-?-connected space.

     The result involution graph of a finite group , denoted by  is an undirected simple graph whose vertex set is the whole group  and two distinct vertices are adjacent if their product is an involution element. In this paper, result involution graphs for all Mathieu groups and connectivity in the graph are studied. The diameter, radius and girth of this graph are also studied. Furthermore, several other graph properties are obtained.

In this paper we have made different regular graphs by using block designs. In one of our applicable methods, first we have changed symmetric block designs into new block designs by using a method called a union method. Then we have made various regular graphs from each of them. For symmetric block designs with  (which is named finite projective geometry), this method leads to infinite class of regular graphs. With some examples we will show that these graphs can be strongly regular or semi-strongly regular. We have also propounded this conjecture that if two semi-symmetric block designs are non-isomorphic, then the resultant block graphs of them are non-isomorphic, too.

F index is a connected graph, sum of the cubes of the vertex degrees. The forgotten topological index has been designed to be employed in the examination of drug molecular structures, which is extremely useful for pharmaceutical and medical experts in understanding the biological activities. Among all the topological indices, the forgotten index is based on degree connectivity on bonds. This paper characterized the forgotten index of union of graphs, join graphs, limits on trees and its complements, and accuracy is measured. Co-index values are analyzed for the various molecular structure of chemical compounds

      In this paper, we show that each soft topological group is a strong small soft loop transfer space at the identity element. This indicates that the soft quasitopological fundamental group of a soft connected and locally soft path connected space, is a soft topological group.

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

For several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.