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

Abstract

Terpai [22] proved the Nordhaus-Gaddum bound that μ(G) + μ(G) 4n/3 - 1, where μ(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 s+(G) + s+(G) < 2n and conjecture that s+(G) + s+(G) 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…