Papers
Topics
Authors
Recent
Search
2000 character limit reached

Nordhaus-Gaddum and other bounds for the sum of squares of the positive eigenvalues of a graph

Published 27 Jul 2016 in math.CO | (1607.08258v2)

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

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.