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

Around the same time he observed that it’s also always possible to split the vertices in a graph into two subgraphs such that the vertices in one all have even degree and the vertices in the other all ...

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 related problems, such as when a set of integers is ...

Gallai–Ramsey number: The minimum number of vertices in a complete graph such that every Gallai colouring using a given number of colours yields a monochromatic copy of a specified subgraph.

The Graphalytics benchmark is an industrial-grade benchmark for graph analysis. This benchmark can test datasets with up to 100 million vertices and 9.4 billion edges.

These methods involve assigning numerical labels to the vertices and edges of a graph to generate unique weight sums, thereby distinguishing each element’s role within the structure.