A review on the relationship between computer engineering : discrete-math and graph theory

الملخص EN

This review is based on understanding the main concept between computerengineering and mathematics based on two of their most important fields, thediscrete-math and graph theory.

and answering the question that was asked bymany students over the years of working in the university, about the necessity ofstudying mathematics while majoring computer engineering.

Most of the studentsface the same problem over years for not having the vision to connect betweenstudying materials of their specialization and general ones, in particular betweenstudying discrete-math engineering as in Engineering analysis, and discrete-mathas in the Digital signal Processing (DSP), and between algebraic mathematics.

Moreover, they do not understand the main idea of the transition between differenttime or frequency domains, by converting the work in real-time domain systems towork in discrete–time or frequency domain systems.

And they do ignore theimportance of studying graph theory, in which recent researches have proved thepowerful of using graphs in learning tasks, developing an important field ofcomputer engineering, the machine learning, where the standard neural networks(SNNs) have been developed to graph neural networks (GNNs).

A figure wasconcluded at the end of the review to brief the importance of discrete-mathdeveloping the relationship between computer engineering in general and graphtheory's role in developing machine learning in particular.