The incidence matrices of various graphs are considered. By reordering the points, the bandwidth can be changed. In the cases of rectangular grids in the plane or cubic grids in three dimensions, the ...

A pair of mathematicians solved a legendary question about the proportion of vertices in a graph with an odd number of connections. “It’s a bit of a surprise, at least for me, that such a combination ...

This is a preview. Log in through your library . Abstract This paper is mainly concerned with the realizability of a set of n integers as the degrees of vertices of an n-vertex linear graph. Other ...

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

Researchers have proved a special case of the Erdős-Hajnal conjecture, which shows what happens in graphs that exclude anything resembling a pentagon. When you walk into a room full of people, you can ...