Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...

Graph Domination Theory is a fundamental area in combinatorial optimisation and theoretical computer science that examines dominating sets and their diverse extensions. At its core, a dominating set ...

Commuting graphs have emerged as a powerful framework for elucidating complex relationships within finite group theory. In these graphs, vertices typically represent non-central elements of a group, ...

For those who hear the phrase “graph theory” and think of the basic pie charts and bar graphs introduced in elementary school, there’s a new world to be explored. “In graph theory, the most simple way ...

Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now proved that it’s “universally optimal.” The Quanta Newsletter ...