The concept of the order sum graph associated with a finite group based on the order of the group and order of group elements is introduced. Some of the properties and characteristics such as size, chromatic number, domination number, diameter, circumference, independence number, clique number, vertex connectivity, spectra, and Laplacian spectra of the order sum graph are determined. Characterizations of the order sum graph to be complete, perfect, etc. are also obtained.

      The present work has been characterized by higher order modes in the cavities of the Gyrotron; they are capable of producing RF plasma by developments of it. It uses for fusion systems. We choose the TE_31,8 mode in our study. The main problem of gyrotron is the device of the thermal cavity loading. The problem of the thermal loading is solved when any parasitic modes suppress, absence of desired modes; the thermal loading is increased when the high power tube of gyrotron operation is unstable. The mathematical interaction model contains equations that describe the electron motion and the field profiles of the transferred electric modes of the resonator, these are interacting with electrons based

The investigation of determining solutions for the Diophantine equation  over the Gaussian integer ring for the specific case of  is discussed. The discussion includes various preliminary results later used to build the resolvent theory of the Diophantine equation studied. Our findings show the existence of infinitely many solutions. Since the analytical method used here is based on simple algebraic properties, it can be easily generalized to study the behavior and the conditions for the existence of solutions to other Diophantine equations, allowing a deeper understanding, even when no general solution is known.

In this work,  an explicit formula for a class of Bi-Bazilevic univalent functions involving differential operator is given, as well as the determination of upper bounds for the general Taylor-Maclaurin coefficient of a functions belong to this class, are established Faber polynomials are used as a coordinated system to study the geometry of the manifold of coefficients for these functions. Also determining bounds for the first two coefficients of such functions.

         In certain cases, our initial estimates improve some of the coefficient bounds and link them to earlier thoughtful results that are published earlier.

The objective of the research is to uncover the effect of the strategy of Quranic verses in the collection of science and systemic intelligence for second-grade students. The research sample consisted of (48) students of second grade students in the middle of Al Rasheed Boys School of the second Karkh Directorate, Distribution in the two divisions, Division of (b) and experimental group that studied strategy of Quranic verses, and the Division (a) control group which studied the regular way, and results indicated a statistically significant differences for the experimental group students studied using the strategy Verses in systemic intelligence collection.

Background: The main objective was to compare the outcome of single layer interrupted extra-mucosal sutures with that of double layer suturing in the closure of colostomies.

Subjects and Methods: Sixty-seven patients with closure colostomy were assigned in a prospective randomized fashion into either single layer extra-mucosal anastomosis (Group A) or double layer anastomosis (Group B). Primary outcome measures included mean time taken for anastomosis, immediate postoperative complications, and mean duration of hospital stay. Secondary outcome measures assessed the postoperative return of bowel function, and the overall mean cost. Chi-square test and student t-test did the statistical analysis..

Resu

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of cove