Article citations More>> E. A. Bertram, “Some Applications of Graph Theory to Finite Groups,” Discrete Mathematics, Vol. 44, No. 1, 1983, pp. 31-43. doi:10.1016/0012-365X (83)90004-3 has been cited by ...

CSE230: Discrete Mathematics Set theory, Elementary number theory, Graph theory, Paths and trees, Boolean Algebra, Binary Relations, Functions, Algebraic system, Generating functions, Induction, ...

In this course, we will cover the fundamental concepts of Discrete Mathematics CSE-103, including logic, set theory, functions, mathematical induction, graph theory, and more. The repository provides ...

On the other hand, what happens for infinite groups? Since the status of knowledge of the non-commuting graph and of the prime graph is satisfactory, is it possible to find relations between these two ...

Norman L. Biggs, Discrete Mathematics, Oxford University Press; T H Cormen, C E Leiserson & R Rivest and C Stein, Introduction to Algorithms, Cambridge University Press; R Diestel, Graph Theory, ...

Norman L. Biggs, Discrete Mathematics, Oxford University Press; T H Cormen, C E Leiserson & R Rivest and C Stein, Introduction to Algorithms, Cambridge University Press; R Diestel, Graph Theory, ...

Discrete mathematics is the real-world application of numbers. Fields that rely on discrete mathematics include computer science and cryptography.

Discrete Mathematics (G5136) 15 credits, Level 4 Autumn teaching Mathematics developed because humans had the need to count objects, or to understand the land around them (e.g. areas, volumes, ...