Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in  is either a pendent vertex or a support vertex and  has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.

The research aims to analysis of the current financial crisis in Iraq through knowing its causes and then propose some solutions that help in remedy the crisis and that on the level of expenditures and revenues, and has been relying on the Federal general budget law of the Republic of Iraq for the fiscal year 2016 to obtain the necessary data in respect of the current expenditures and revenues which necessary to achieve the objective of the research , and through the research results has been reached to a set of conclusions which the most important of them that causes of the current financial crisis in Iraq , mainly belonging to increased expenditures and especially the current ones and the lack of revenues , especially non-oil o

The issue of the development of Qur'anic studies for the tasks, and the first thought of minds and multiple understandings, and the most precious ideas, and the alternatives were floated, and varied visions, especially as we live in an era exploding knowledge, and complicate secretions, and scramble his ideas, and to devise intellectual approaches To achieve the witnesses of civilization in the words of the Almighty (to be martyrs on the people) Surat Al - Baqarah / 143 attendance and participation in the achievement and a positive interaction with the participants of humanity and civilization in the light of the meaning (to know) rooms / 13.
Therefore, we must emerge from the one-dimensional view of the Koran to the complex mindset t

In 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

Steganography can be defined as the art and science of hiding information in the data that could be read by computer. This science cannot recognize stego-cover and the original one whether by eye or by computer when seeing the statistical samples. This paper presents a new method to hide text in text characters. The systematic method uses the structure of invisible character to hide and extract secret texts. The creation of secret message comprises four main stages such using the letter from the original message, selecting the suitable cover text, dividing the cover text into blocks, hiding the secret text using the invisible character and comparing the cover-text and stego-object. This study uses an invisible character (white space

Literary translation is one of the most difficult types of translation ,because it conveys feelings that differ from one person to another, and since the language constitutes an obstacle to understanding the Andalusian excerpts, the translators resorted to translating it, and this was a second start to the text, different from its first start, is said from the tongue of the Al-washah , The muwashshah is a poetic art that appeared in Andalusia after the Arabs entered it ,characterized by special system It differs from the traditional Arabic poem, as it has a beginning represented in the beginning of the muwashshah and several equal parts ending with differentrhymes.

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

At the level of both individuals and companies, Wireless Sensor Networks (WSNs) get a wide range of applications and uses. Sensors are used in a wide range of industries, including agriculture, transportation, health, and many more. Many technologies, such as wireless communication protocols, the Internet of Things, cloud computing, mobile computing, and other emerging technologies, are connected to the usage of sensors. In many circumstances, this contact necessitates the transmission of crucial data, necessitating the need to protect that data from potential threats. However, as the WSN components often have constrained computation and power capabilities, protecting the communication in WSNs comes at a significant performance pena