Spectral Tur\'an problem for tK4--free unbalanced signed graphs

Abstract

Let tK4 denote the family of all graphs consisting of t copies of K4 that are allowed to share vertices and tK4- be the set of all unbalanced signed graphs whose underlying graphs are elements of tK4. In this paper, we characterize the extremal graphs that achieve the maximum index and spectral radius among all tK4--free unbalanced signed graphs with given order.

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…