The recent developments in information technology have made major changes in all fields. The transfer of information through networks has become irreplaceable due to its advantages in facilitating the requirements of modern life through developing methods of storing and distributing information. This in turn has led to an increase in information problems and risks that threaten the security of the institution’s information and can be used in distributed systems environment. This study focused on two parts; the first is to review the most important applications of the graph theory in the field of network security, and the second is focused on the possibility of using the Euler graph as a Method Object that is employed in Remote Method Invocation (RMI) technique. This algorithm was compared with the most popular algorithms, such as RSA and 3DES. The results were acceptable and need to be improved in the future.
This review is based on understanding the main concept between computer engineering and mathematics based on two of their most important fields, the discrete-math and graph theory. and answering the question that was asked by many students over the years of working in the university, about the necessity of studying mathematics while majoring computer engineering. Most of the students face the same problem over years for not having the vision to connect between studying materials of their specialization and general ones, in particular between studying discrete-math engineering as in Engineering analysis, and discrete-math as in the Digital signal Processing (DSP), and between algebraic mathematics. Moreover, they do not understand the main idea of the transition between different time or frequency domains, by converting the work in real-time domain systems to work in discrete–time or frequency domain systems. And they do ignore the importance of studying graph theory, in which recent researches have proved the powerful of using graphs in learning tasks, developing an important field of computer engineering, the machine learning, where the standard neural networks (SNNs) have been developed to graph neural networks (GNNs). A figure was concluded at the end of the review to brief the importance of discrete-math developing the relationship between computer engineering in general and graph theory’s role in developing machine learning in particular.
A dominating set S of a graph , is a subset of the vertex set V (G) such that any vertex not in S is adjacent to at least one vertex in S .The domination number of a graph G denoted by is the minimum size of the dominating sets of G. In this paper we introduced the domination numbers of certain prism graphs.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.