The index of tC3--free signed graphs

Abstract

The classical spectral Tur\'an problem is to determine the maximum spectral radius of an F-free graph of order n. This paper extends this framework to signed graphs. Let Cr- be the set of all unbalanced signed graphs with underlying graphs Cr. Wang, Hou and Li [Linear Algebra Appl, 681 (2024) 47-65] previously determined the spectral Tur\'an number of C3-. In the present work, we characterize the extremal graphs that achieve the maximum index among all unbalanced signed graphs of order n that are tC3--free for t≥ 2. Furthermore, for t≥ 3, we identify the graphs with the second maximum index among all tC3--free unbalanced signed graphs of fixed order n.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…