combinatorics / Spectral graph theory
For every connected graph, is the variance of its positive adjacency eigenvalues at most its order divided by its average distance? Exact dumbbell-graph certificates refute the bound under both conventions for average distance.
Temporal state
No reconciled state yet.
Append-only history
For every connected graph, is the variance of its positive adjacency eigenvalues at most its order divided by its average distance? Exact dumbbell-graph certificates refute the bound under both conventions for average distance.
Research memory
For every connected graph, is the variance of its positive adjacency eigenvalues at most its order divided by its average distance? Exact dumbbell-graph certificates refute the bound under both conventions for average distance.
Evidence graph
No public relationships recorded yet.