Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph (1607.08258v2)

Published 27 Jul 2016 in math.CO

Abstract: Terpai [22] proved the Nordhaus-Gaddum bound that $\mu(G) + \mu(\overline{G}) \le 4n/3 - 1$, where $\mu(G)$ is the spectral radius of a graph $G$ with $n$ vertices. Let $s+$ denote the sum of the squares of the positive eigenvalues of $G$. We prove that $\sqrt{s{+}(G)} + \sqrt{s+(\overline{G})} < \sqrt{2}n$ and conjecture that $\sqrt{s{+}(G)} + \sqrt{s+(\overline{G})} \le 4n/3 - 1.$ We have used AutoGraphiX and Wolfram Mathematica to search for a counter-example. We also consider Nordhaus-Gaddum bounds for $s+$ and bounds for the Randi\'c index.

Summary

We haven't generated a summary for this paper yet.