Signed graphs with maximal index
Abstract
The index of a signed graph is the largest eigenvalue of its adjacency matrix. For positive integers n and m n2/4, we determine the maximal index of complete signed graphs with n vertices and m negative edges. This settles (the corrected version of) a conjecture by Koledin and Stani\'c (2017).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.