Integral Cayley graphs, a notable subject within spectral graph theory, are graphs constructed from finite groups with the defining property that all eigenvalues of their associated adjacency matrices ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...