Let be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset is a minimum neighborhood dominating set if is a dominating set and if for every holds. The minimum cardinality of the minimum neighborhood dominating set of a graph is called as minimum neighborhood dominating number and it is denoted by . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the smallest number of vertices needed to form a minimum neighborhood-dominating set. The concept of minimum neighborhood dominating set is related to the study of the structure and properties of graphs and is used in various fields such as computer science, operations research, and network design. A minimum neighborhood dominating set is also useful in the study of graph theory and has applications in areas such as network design and control theory. This concept is a variation of the traditional dominating set problem and adds an extra constraint on the intersection of the neighborhoods of the vertices in the set. It is also an NP-hard problem. The main aim of this paper is to study the minimum neighborhood domination number of the split graph of some of the graphs.
the mental image is so important in human life as one of the major standers for his trends and behavior, and as the human nature requires to interest in things based on how much it’s close to and how much it effects on his interest, So the neighborhood countries was one of the topics that occupied the attention of the Iraqi individual and pushed him to form perceptions of them based on the cultural heritage and the historical relations of Iraq with these countries as well as the actions of neighboring countries on Iraq and the resulting effects on the course of events. the mental image is so important in human life as one of the major standers for his trends and behavior, and as the human nature requires to interest in things bas
... 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 MoreThe issue of the prisoners' rights and the way of dealing with them is not just a minor or
primary issue according to the contemporary attitudes to deal with criminals, but it is a fatal
issue that goes with the development of life and comprehension of human rights. As the
criminal is considered as a human-being who can be reformed and qualified, according to the
aims of the contemporary social service the prisoner is regarded as an idle human source who
can be reformed, treated and qualified so as to make him participate to improve his family and
society in the end.
This study aims at reconstructing the prisons bases when applying the laws of the lowest
level of treatment through the research of oppositions, atti
Let R be a commutative ring , the pseudo – von neuman regular graph of the ring R is define as a graph whose vertex set consists of all elements of R and any two distinct vertices a and b are adjacent if and only if , this graph denoted by P-VG(R) , in this work we got some new results a bout chromatic number of P-VG(R).
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 .
The 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.
A new definition of a graph called Pure graph of a ring denote Pur(R) was presented , where the vertices of the graph represent the elements of R such that there is an edge between the two vertices ???? and ???? if and only if ????=???????? ???????? ????=????????, denoted by pur(R) . In this work we studied some new properties of pur(R) finally we defined the complement of pur(R) and studied some of it is properties
The main objective of the audit is The asset is maintained and operated efficiently and is done through to detect fraud and errors in the financial statements and to verify the accuracy and accuracy of the information contained therein and to give a neutral technical opinion on the basis of that, thus the auditor has a professional responsibility in achieving this goal, and that the effects of issuing a wrong opinion works on The loading of the beneficiaries is significant damage, And therefore the presence of any error or bias of the auditor when taking personal judgments in relation to the determination of the relative importance and the selection of audit samples and determine the adequacy and validity of evidence and implemen
... Show MoreThe main purpose of this paper, is to introduce a topological space , which is induced by reflexive graph and tolerance graph , such that may be infinite. Furthermore, we offered some properties of such as connectedness, compactness, Lindelöf and separate properties. We also study the concept of approximation spaces and get the sufficient and necessary condition that topological space is approximation spaces.
Background: The surgical treatment of pilonidal sinus varies from wide excision and laying the wound open or excision with primary closure or excision with the use of skin graft in some special cases.
Objectives: The objectives of this study is to determine the efficacy of treating non complicated pilonidal sinus disease with minimal excision and primary closure technique, complications and recurrence rate.
Patients and methods: This is a prospective study conducted in shahid ahmed ismaiel hospital in rania – As sulaimania IRAQ during the period from December 2013 to January 2016 and was carried on one hundred (100) consecutive patients with non complicated non recurrent pilonidal sinus patients who were treated with minimal exci