Let 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 is either two or five only.
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.
The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.
The problem of present study is determined by answering the following questions:
1) What is the effect of using the oral open- ended questions on Students' achievement in the third-stage of Arabic department in the college of Education? 2) What is the effect of the oral open-ended questions on developing the creative thinking of students in
... Show MoreNano-crystalline iron oxide nanoparticles (magnetite) was synthesized by open vessel ageing process. The iron chloride solution was prepared by mixing deionized water and iron chloride tetrahydrate. The product was characterized by X-Ray, Surface area and pore volume by Brunauer-Emmet-Teller, Atomic Force Microscope (AFM) and Fourier Transform Infrared Spectroscopy(FTIR) . The results showed that the XRD in compatibility of the prepared iron oxide (magnetite) with the general structure of standard iron oxide, and in Fourier Transform Infrared Spectroscopy, it is strong crests in 586 bands, because of the expansion vibration manner related to the metal oxygen absorption band (Fe–O bonds in the crystals of iron ox
... Show MoreThe aim of this paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.
The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.
An edge dominating set of a graph is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number. The odd (even) sum degree edge domination number is the minimum cardinality taken over all odd (even) sum degree edge dominating sets of G and is defined as zero if no such odd (even) sum degree edge dominating set exists in G. In this paper, the odd (even) sum degree domination concept is extended on the co-dominating set E-T of a graph G, where T is an edge dominating set of G. The corresponding parameters co-odd (even) sum degree edge dominating set, co-odd (even) sum degree edge domination number and co-odd (even) sum degree edge domin
... Show MorePeroxidase is a class of oxidation-reduction reaction enzyme that is useful for accelerating many oxidative reactions that protect cells from the harmful effects of free radicals. Peroxidase is found in many common sources like plants, animals and microbes and have extensive uses in numerous industries such as industrial, medical and food processing. In this study, P. aeruginosa was harvested to utilize and study its peroxidases. P. aeruginosa was isolated from a burn patient, and the isolate was verified as P. aeruginosa using staining techniques, biochemical assay, morphological, and a sensitivity test. The gram stain and biochemical test result show rod pink gram-ne
... Show MoreThe tagged research (realism in the Paintings of Iraqi Kurdistan artists, “a study of expression methods”) dealt with realism in an objective way, as well as the complexity of its concepts through its formations and formations. On realism and its historical dimension in concept and meaning, as for the second chapter, the research was focused on the methods of expression in painting, while the third chapter was concerned with the procedural applications of realistic methods of expression in the drawings of Iraqi Kurdistan, and according to these axes and to achieve the goal of the research, a number of Among the results are:
1- Realism documented the life of the Kurdish society in line with the developments of the era, as the sty
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.