In this paper we introduce two Algorithms, the first Algorithms when it is odd order and how we calculate magic square and rotation for it. The second Algorithms when it be even order and how to find magic square and rotation for it.
Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in is either a pendent vertex or a support vertex and has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.
The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs and , for some special graphs . The dominant metric dimension of is denoted by and the dominant metric dimension of corona product graph G and H is denoted by .
A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.
To decrease the dependency of producing high octane number gasoline on the catalytic processes in petroleum refineries and to increase the gasoline pool, the effect of adding a suggested formula of composite blending octane number enhancer to motor gasoline composed of a mixture of oxygenated materials (ethanol and ether) and aromatic materials (toluene and xylene) was investigated by design of experiments made by Mini Tab 15 statistical software. The original gasoline before addition of the octane number blending enhancer has a value of (79) research octane number (RON). The design of experiments which study the optimum volumetric percentages of the four variables, ethanol, toluene, and ether and xylene materials leads
... Show MoreIt was known that every left (?,?) -derivation is a Jordan left (?,?) – derivation on ?-prime rings but the converse need not be true. In this paper we give conditions to the converse to be true.
The ground state properties including the density distributions of the neutrons, protons and matter as well as the corresponding root mean square (rms) radii of proton-rich halo candidates 8B, 12N, 23Al and 27P have been studied by the single particle Bear– Hodgson (BH) wave functions with the two-body model of (core+p). It is found that the rms radii of these proton-rich nuclei are reproduced well by this model and the radial wave functions describe the long tail of the proton and matter density distributions. These results indicate that this model achieves a suitable description of the possible halo structure. The plane wave Born approximation (PWBA) has been used to compute the elastic charge form factors.
An experimental investigation of the variation of argon discharge current with a glow and afterglow time intervals of a square discharge voltage was carried out at low pressure (6-11 mbar). The discharge was created between two circular metal electrodes of diameter (7.5 cm), separated horizontally by a distance (10 cm) at the two ends of a Pyrex cylindrical tube. A composite of two Gaussian functions has been suggested to fit and explain the variation graphs clearly. It is shown that the necessary times of glow and afterglow needed to attain a maximum discharge current are (70 us) and (60 us), respectively. The discharge current is observed to drop to the lowest value when the two times are serially longer than (85 us) and (72 u
... Show MoreIn the case where a shallow foundation does not satisfy with design requirements alone, the addition of a pile may be suitable to improve the performance of the foundation design. The lack of in-situ data and the complexity of the issues caused by lagging in the research area of pile foundations are notable. In this study, different types of piles were used under the same geometric conditions to determine the load-settlement relationships with various sandy soil relative densities. The ultimate pile capacity for each selected pile is obtained from a modified California Bearing Ratio (CBR) machine to be suitable for axial pile loading. Based on the results, the values of Qu for close-ended square pile were increased by 15
... Show More
In this work, a test room was built in Baghdad city, with (2*1.5*1.5) m3 in dimensions, while the solar chimneys (SC) were designed with aspect ratio (ar) bigger than 12. Test room was supplied by many solar collectors; vertical single side of air pass with ar equals 25, and tilted 45o double side of air passes with ar equals 50 for each pass, both collectors consist of flat thermal energy storage box collector (TESB) that covered by transparent clear acrylic sheet, third type of collector is array of evacuated tubular collectors with thermosyphon in 45o instelled in the bottom of TESB of vertical SC. The TESB was
... Show MoreThe encoding of long low density parity check (LDPC) codes presents a challenge compared to its decoding. The Quasi Cyclic (QC) LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure. Most QC-LDPC codes have rank deficient parity matrix and this introduces extra complexity over the codes with full rank parity matrix. In this paper an encoding scheme of QC-LDPC codes is presented that is suitable for codes with full rank parity matrix and rank deficient parity matrx. The extra effort required by the codes with rank deficient parity matrix over the codes of full rank parity matrix is investigated.