Extremal graph theory seeks to determine the maximum or minimum values of graph invariants—such as edge count, degree sequence or subgraph density—subject to the exclusion of particular configurations ...
The Laplacian spectrum of a graph comprises the eigenvalues of its Laplacian matrix, a fundamental operator defined as the difference between the degree matrix and the adjacency matrix. This spectrum ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results