Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a public transportation network. Mathematicians have long sought to develop ...
Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...
The zeta function of a graph, inspired by analogues in number theory and differential geometry, encodes fundamental cycle and path data in a compact analytic form. Its prototypical instance, the Ihara ...
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 ...
The Laplacian spectrum of a graph comprises the eigenvalues of its Laplacian matrix, a fundamental operator defined as the difference between the degree matrix and the adjacency matrix. This spectrum ...
There are many types of networks, such as those for traffic, communication, socialising and molecules. Graphs are the mathematical abstractions of such networks, and ...
Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm ...
Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...
Michał Pilipczuk, a mathematician and computer scientist nominated by the university, has been selected for Germany’s most prestigious international research award. The Cluster of Excellence ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results