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.
This paper introduces some properties of separation axioms called α -feeble regular and α -feeble normal spaces (which are weaker than the usual axioms) by using elements of graph which are the essential parts of our α -topological spaces that we study them. Also, it presents some dependent concepts and studies their properties and some relationships between them.
In this work, a deep computational study has been conducted to assign several qualities for the graph . Furthermore, determine the amount of the dihedral subgroups in the Held simple group He through utilizing the attributes of gamma.
Let G be a finite group, the result is the involution graph of G, which is an undirected simple graph denoted by the group G as the vertex set and x, y ∈ G adjacent if xy and (xy)2 = 1. In this article, we investigate certain properties of G, the Leech lattice groups HS and McL. The study involves calculating the diameter, the radius, and the girth of ΓGRI.
The purpose of this paper is to apply different transportation models in their minimum and maximum values by finding starting basic feasible solution and finding the optimal solution. The requirements of transportation models were presented with one of their applications in the case of minimizing the objective function, which was conducted by the researcher as real data, which took place one month in 2015, in one of the poultry farms for the production of eggs
... Show MoreWhat happened on the Iraq war in 2003 put the problematic about what can happen from a shift in the style of individual or collective in contemporary Iraqi art similar to what is known in the history of the modern art world.
It wanted the researcher to identify this dilemma in academic study looking for an explanation of this Alastfhamat from the entrance of the definitions shows laparoscopic destination, as it determines the address (b style in painting contemporary Aeraa before and after the war) was a comparative analysis, through a choice of two Iraqi artists who have production style known sets since before the war, in order to read the transformation that took place in art before and after their tactics, and in order to off
... Show MoreBridging the Gap between Graphemes and Phonemes in the Phonetic Transcription
Indexes of topological play a crucial role in mathematical chemistry and network theory, providing valuable insights into the structural properties of graphs. In this study, we investigate the Resize graph of G2(3), a significant algebraic structure arising from the exceptional Lie group (G2) over the finite field F3. We compute several well-known topological indices, including the Zagreb indices, Wiener index, and Randić index, to analyze the graph's connectivity and complexity. Our results reveal intricate relationships between the algebraic structure of G2(3) and its graphical properties, offering a deeper understanding of its combinatorial and spectral characteristics. These findings contribute to the broader study of algebraic graph t
... Show MoreConcentrated research topic in the study of key variables in the work of the inspectors general offices , which are in the application of quality management standards audit work and reduce the incidence of corruption. It highlights the importance of current research in being a serious attempt aimed at highlighting the role of the importance of standards of quality management audit work , because they represent a router and leader of the accountant or ( Sergeant ) in the performance of his work and the extent of compliance with these standards , as well as highlight the role of quality audit in reducing the incidence of corruption , of during the professional performance of Higher auditors and determine the responsibilities entrus
... Show MoreThe research aims to study and definition of the concept of creative accounting and motives adopted by the management of companies to achieve their own goals and their impact on the reliability of the financial statements and the tax settling accounts and whether that tax administration is able to detect and limit the creative accounting practices and impose legal sanctions deterrent against companies The research has come to a set of conclusions, including:
- The administration motives in the use of creative accounting methods, some internal motives related to the interests of the administration in maximizing profits to increase incentives and rewards, others are external, such as the impact on stock prices or reduce the am