With simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied to some special graphs.
The concept of the optical telescope is the primary mirror design, the Next Generation Segmented Optical Telescope (NGST) with hexagonal segment of spherical primary mirror can provide a 3 arc minutes field of view. Extremely Large Telescopes (ELT) in the 100m dimension would have such unprecedented scientific effectiveness that their construction would constitute a milestone comparable to that of the invention of the telescope itself and provide a truly revolutionary insight into the universe. The scientific case and the conceptual feasibility of giant filled aperture telescopes was our interested. Investigating the requirements of these imply for possible technical options in the case of a 100m telescope. For this telescope the conside
... Show MoreSuppose that is a finite group and is a non-empty subset of such that and . Suppose that is the Cayley graph whose vertices are all elements of and two vertices and are adjacent if and only if . In this paper, we introduce the generalized Cayley graph denoted by that is a graph with vertex set consists of all column matrices which all components are in and two vertices and are adjacent if and only if , where is a column matrix that each entry is the inverse of similar entry of and is matrix with all entries in , is the transpose of and . In this paper, we clarify some basic properties of the new graph and assign the structure of when is complete graph , complete bipartite graph and complete
... Show MoreTruncated distributions arise naturally in many practical situations. It’s a conditional distribution that develops when the parent distribution's domain is constrained to a smaller area. The distribution of a right truncated is one of the types of a single truncated that is restricted within a specific field and usually occurs when the specified period for the study is complete. Hence, this paper introduces Right Truncated Inverse Generalized Rayleigh Distribution (RTIGRD) with two parameters is introduced. Then, provided some properties such as; (probability density function, cumulative distribution function (CDF), survival function, hazard function, rth moment, mean, variance, Moment Generating Function, Skewness, kurtosi
... Show MoreConsider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph make up the graph's quotient energy. The objective of this study is to examine the quotient energy of identity graphs and zero-divisor graphs of commutative rings using group theory, graph theory, and applications. In this study, the identity graphs derived from the group and a few classes of zero-divisor graphs of the commutative ring R are examined.
The purpose of this project is to build a scientific base and computational programs in an accelerator design work. The transfer of group of laws in alinear accelerator cavity to computer codes written in Fortran power station language is inorder to get a numerical calculation of an electromagnetic field generated in the cavities of the linear accelerator. The program in put contains mainly the following, the geometrical cavity constant, and the triangular finite element method high – order polynomial. The out put contains vertical and horizontal components of the electrical field together with the electrical and the magnetic field intensity.
Transforming the common normal distribution through the generated Kummer Beta model to the Kummer Beta Generalized Normal Distribution (KBGND) had been achieved. Then, estimating the distribution parameters and hazard function using the MLE method, and improving these estimations by employing the genetic algorithm. Simulation is used by assuming a number of models and different sample sizes. The main finding was that the common maximum likelihood (MLE) method is the best in estimating the parameters of the Kummer Beta Generalized Normal Distribution (KBGND) compared to the common maximum likelihood according to Mean Squares Error (MSE) and Mean squares Error Integral (IMSE) criteria in estimating the hazard function. While the pr
... Show MoreChemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.
In this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.
In the current study, the definition of mapping of fuzzy neutrosophic generalized semi-continuous and fuzzy neutrosophic alpha has generalized mapping as continuous. The study confirmed some theorems regarding such a concept. In the following, it has been found relationships among fuzzy neutrosophic alpha generalized mapping as continuous, fuzzy neutrosophic mapping as continuous, fuzzy neutrosophic alpha mapping as continuous, fuzzy neutrosophic generalized semi mapping as continuous, fuzzy neutrosophic pre mapping as continuous and fuzzy neutrosophic γ mapping as continuous.
The topological indices are functions on the graph that do not depend on the labeling of their vertices. They are used by chemists for studying the properties of chemical compounds. Let be a simple connected graph. The Hyper-Zagreb index of the graph , is defined as ,where and are the degrees of vertex and , respectively. In this paper, we study the Hyper-Zagreb index and give upper and lower bounds for .