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.
Data security is an important component of data communication and transmission systems. Its main role is to keep sensitive information safe and integrated from the sender to the receiver. The proposed system aims to secure text messages through two security principles encryption and steganography. The system produced a novel method for encryption using graph theory properties; it formed a graph from a password to generate an encryption key as a weight matrix of that graph and invested the Least Significant Bit (LSB) method for hiding the encrypted message in a colored image within a green component. Practical experiments of (perceptibility, capacity, and robustness) were calculated using similarity measures like PSNR, MSE, and
... Show MoreIn this thesis, we study the topological structure in graph theory and various related results. Chapter one, contains fundamental concept of topology and basic definitions about near open sets and give an account of uncertainty rough sets theories also, we introduce the concepts of graph theory. Chapter two, deals with main concepts concerning topological structures using mixed degree systems in graph theory, which is M-space by using the mixed degree systems. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are defined and studied. In chapter three we study supra-approximation spaces using mixed degree systems and primary object in this chapter are two topological
... 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.
Air pollution is considered one of the major environmental problems that contain many challenges and difficulties facing most countries of the world, including Iraq. The problem has emerged widely with the emergence of the industrial revolution in the world and the tremendous increase in the population and the increase in the number of transportation and its development in addition to excavation, maintenance and work Construction and weather fluctuations, such as dust and sandstorms, pollution resulting from oil refining, extraction, diversion and other processes that cause pollution, and the start of the world using methods that limit the volume of environmental pollution. The most prominent of these methods is the imposition of
... Show MoreThis research attempts to evaluate the role of the information system by highlighting its importance in providing date and information to the tax administration the process of tax accounting for those who are subject to income tax whether they are individuals or companies where the effective information system provides accurate and reliable information in a timely manner.
At the theoretical part of the research, the research approaches the problem of the research represented in that whether the information system, applied in the General Commission for Taxes, is capable of achieving its role in reducing the phenomenon of tax evasion. The existence of a set of things which in the Commission may lead to increase tax evasion by taxpa
... Show Moreملخص البحث: تعتبر مشكلة تعاطي المخدرات من المشكلات التي تؤثر في بناء المجتمع وأفراده لما يترتب عليها من آثار اجتماعية واقتصادية ونفسية سيئة تنسحب على الفرد و على المجتمع، كما أنها ظاهرة اجتماعية مرضية تدفع إليها عوامل عديدة؛ بعضها يتعلق بالفرد والبعض الآخر بالأسرة والثالث بالبناء الاجتماعي ككل. وتعد ظاهرة انتشار المخدرات من الظواهر الأكثر تعقيدا وبارزة هذه الظاهر ة وإحدى مشكلات العصر، الشاملة في المجتمع، و
... Show MoreTopological 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.