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.
Fraud crimes, which is a form of crimes against the funds in public office, is one of the crimes of traditional and cutting-edge in the same time, but it took a distinct character from other traditional crimes because of what is based upon, behavioral fundamentals and foundations and expressive image of personal qualities, concentrated in the mental work, the inventive sophistication, and skillful abilities of the perpetrators of these crimes, in addition to what is owned by crooks today a behavioral ability represented in underestimating laws and instructions. Fraud is considered one of the organized crime methods It is the most important method of its methods, all crimes practiced by the cro
... Show MoreThe research dealt with the effect of the tax examiner's efficiency in detecting tax evasion, as the research problem dealt with tax evasion, especially in Iraq, for many reasons and factors, including those related to tax administration represented in administrative corruption and the complexity of procedures in the tax accounting process and failure to achieve justice in the tax treatment, including the taxpayer himself, as he tries to evade for reasons Related to the level of tax awareness, loss of confidence in the tax administration, and reasons related to the state's inability to manage the services file well and its ability to achieve the set goals, This reflected negatively on the emergence of some of the consequences of
... Show MoreThe minimum approaches distance of probing electrons in scanning electron microscope has investigated in accordance to mirror effect phenomenon. The analytical expression for such distance is decomposed using the binomial expansion. With aid of resulted expansion, the distribution of trapped electrons within the sample surface has explored. Results have shown that trapped electron distributes with various forms rather an individual one. The domination of any shape is mainly depend on the minimum approaches distance of probing electrons
In this communication, introduce the split Mersenne and Mersenne-Lucas hybrid quaternions, also obtaining generating functions and Binet formulas for these hybrid quaternions and investigating some properties among them.
Topological indices provide important insights into the structural characteristics of molecular graphs. The present investigation proposes and explores a creative graph on a finite group G, which is known as the RIG. This graph is designated as ΓRS G2(4) indicating a simple undirected graph containing elements of G. Two distinct ertices are regarded as nearly the same if and only if their sum yields a non-trivial involution element in G. RIGs have been discovered in various finite groups. We examine several facets of the RIG by altering the graph through the conjugacy classes of G. Furthermore, we investigate the topological indices as applications in graph theory applying the distance matrix of the G2(4) group.
The aim of this research is to introduce agricultural insurance, to define financing in the form of salam and the role of agricultural insurance in the prevention of risks to agricultural finance operations in the form of salam by verifying the hypotheses through which to reach the results, including the imposition of risks for agricultural finance in the form of salam, The study of agricultural finance in the form of salm, the deductive approach to the development of the problem of research and hypotheses, and the inductive method to extrapolate the results through analysis and brother The researcher concluded that agricultural insurance works to bridge the risks facing agricultural finance in the form of the ladder in cases of
... Show MoreIn this ˑwork, we present theˑ notion of the ˑgraph for a KU-semigroup as theˑundirected simple graphˑ with the vertices are the elementsˑ of and weˑˑstudy the ˑgraph ofˑ equivalence classesˑofˑ which is determinedˑ by theˑ definition equivalenceˑ relation ofˑ these verticesˑ, andˑ then some related ˑproperties areˑ given. Several examples are presented and some theorems are proved. Byˑ usingˑ the definitionˑ ofˑ isomorphicˑ graph, ˑwe showˑ thatˑ the graphˑ of equivalence ˑclasses ˑand the ˑgraphˑof ˑa KU-semigroup ˑ areˑ theˑ sameˑ, in special cases.