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 ...

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 ...

The M-polynomial is a powerful algebraic tool that encodes structural information of molecular graphs and enables the derivation of numerous degree-based topological indices through algebraic ...

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 ...

On March 15, intriguing seminar announcements sent rumblings through the field of combinatorics, the mathematical study of counting. Three collaborators planned to give coordinated talks the following ...

Fuzzy graph theory extends classical graph concepts by assigning to each vertex and edge a value in the interval [0, 1] that represents the degree of membership or presence in the network. This ...