Abstract. In the present paper we are interested in the study of the distance Laplacian eigenvalues of a connected graph with fixed order n and chromatic number χ. We prove lower bounds on the ...

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

Chayes and Borgs's prior university labors on graph theory and phase transitions have been of some use to the enterprise. Since they joined Microsoft, the World Wide Web has come into its own.

Graph Theory Seminar Upcoming Events Apr. 11, 2025 Chvatal's t0- tough conjecture presented by Linda Lesniak at 10 a.m. in the Alavi Commons 6625 Everett Tower Past Events Mar. 28, 2025 The Ramsey ...

This guarantees that every graph has an even subgraph that’s at least half as big as the original. But how big an odd subgraph can be has been an open research question in graph theory for over 60 ...