Recent studies have significantly advanced our understanding of both curvature and Laplacian operators on graphs. In particular, the generalisation of the p‑Laplacian operator on discrete graphs ...

Complementary studies investigating join products of discrete graphs with families of symmetric graphs have further enriched the literature by establishing new relationships between seemingly ...

This course provides an introduction to discrete mathematics, particularly graph theory. Emphasis will be placed on the algorithmic aspects of the area. Topics to be covered include: Brief ...

Some functionalities in Discrete Mathematics include algorithms, set theory, graphs, statements in logic, recursion and probability, and so on. Its importance lies in the fact that most key ...

Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...

In particular, we will deduce theoretical justifications for methods developed on finite weighted graphs. In this context we focus on the theory of optimal transport to make the passage from discrete ...