Remarks on the Brouwer Conjecture
By: Oliver Knill
Potential Business Impact:
Proves math rule for networks, helping computers understand them.
The Brouwer conjecture (BC) in spectral graph theory claims that the sum of the largest k Kirchhoff eigenvalues of a graph are bounded above by the number m of edges plus k(k+1)/2. We show that (BC) holds for all graphs with n vertices if n is larger or equal than 4 times the square of the maximal vertex degree. We also note that the weaker upper bound m+k(k+1) holds unconditionally. We also note that (BC) for graphs implies (BC) for quivers.
Similar Papers
Remarks on the Brouwer Conjecture
Combinatorics
Makes math rules about connected things work better.
The non-existence of some Moore polygons and spectral Moore bounds
Combinatorics
Finds biggest networks with strong connections.
Vertex-Based Localization of Turán's Theorem
Combinatorics
Finds more connections in networks than thought possible.