The spectral radius of unbalanced signed graphs without negative C3 or C4
Abstract
A signed graph is a graph in which every edge carries a + or a - sign. In this paper, we determine the signed graphs with maximum spectral radius among all unbalanced signed graphs with fixed order that contain neither negative three-cycles nor negative four-cycles.
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.