Consider a simple graph on vertices and edges together with a total labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say defined by for all where Also, the value is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by and is the least for which G admits edge irregular h-labeling. In this article, for some common graph families are examined. In addition, an open problem is solved affirmatively.
Consider 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 optical absorption data of Hydrogenated Amorphous Silicon was analyzed using a Dunstan model of optical absorption in amorphous semiconductors. This model introduces disorder into the band-band absorption through a linear exponential distribution of local energy gaps, and it accounts for both the Urbach and Tauc regions of the optical absorption edge.Compared to other models of similar bases, such as the O’Leary and Guerra models, it is simpler to understand mathematically and has a physical meaning. The optical absorption data of Jackson et al and Maurer et al were successfully interpreted using Dunstan’s model. Useful physical parameters are extracted especially the band to the band energy gap , which is the energy gap in the a
... Show MoreThe research aims to study some of the human characteristics of the state of Singapore to know the impact of these characteristics on the strength of the state, its development and. The research included two aspects, theoretical and analytical, using the descriptive analytical method, force analysis method, as well as the historical method. The data was analyzed according to mathematical equations, including the size of the country's population, the extraction of the population growth rate and the concept of age structure, where some indicators related to this concept have been explained. The researcher reached a set of results, the most important of which were: that the population size of the state of Singapore in the period between (19
... Show MoreThe research aims to build a training program to develop the willpower in the kindergarten children. In order to achieve the objective of the research, the two researchers have developed a Training Program according to the following steps:
- Determining the general objective of the Training Program.
- Determining the behavioral objectives of the Training Program.
- Determining the content of the Training Program.
- Implementing the content of the Training Program sessions.
- Evaluating the Training Program.
The training program consisted of (15) sessions, each session included a set of parts (title, general objective, methods, time and place to implement the sessions, behavioral goals, tool
... Show MoreIn this paper, we devoted to use circular shape sliding block, in image edge determination. The circular blocks have symmetrical properties in all directions for the mask points around the central mask point. Therefore, the introduced method is efficient to be use in detecting image edges, in all directions curved edges, and lines. The results exhibit a very good performance in detecting image edges, comparing with other edge detectors results.
The aim of this paper is to present a weak form of -light functions by using -open set which is -light function, and to offer new concepts of disconnected spaces and totally disconnected spaces. The relation between them have been studied. Also, a new form of -totally disconnected and inversely -totally disconnected function have been defined, some examples and facts was submitted.
The present work aims to study the effect of using an automatic thresholding technique to convert the features edges of the images to binary images in order to split the object from its background, where the features edges of the sampled images obtained from first-order edge detection operators (Roberts, Prewitt and Sobel) and second-order edge detection operators (Laplacian operators). The optimum automatic threshold are calculated using fast Otsu method. The study is applied on a personal image (Roben) and a satellite image to study the compatibility of this procedure with two different kinds of images. The obtained results are discussed.
This paper is concerned with the blow-up solutions of a system of two reaction-diffusion equations coupled in both equations and boundary conditions. In order to understand how the reaction terms and the boundary terms affect the blow-up properties, the lower and upper blow-up rate estimates are derived. Moreover, the blow-up set under some restricted assumptions is studied.
In this work, an important sugar alkynyl ether has been synthesized in two subsequent steps starting from commercially available D-galactose (3). This kind of compounds is highly significant in the synthesis of biologically active molecules such as 1,2,3-triazole and isoxazoles. In the first step, galactose (3) was reacted with acetone in the presence of anhydrous copper (II) sulfate to produce 1,2:3,4-di-O-isopropylidene-α-D-galactose (4) in good yield. The latter was reacted with excess of 3-bromoprop-1-yne in DMF in the presence of NaOH pellets to afford the target molecule 5 in a very good yield. The temperature of this step is crucial in determining the reaction yi
... Show MoreLet A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with is the same for all . Here is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i
... Show More