Tur\'an problem for K4--free signed graphs

Abstract

Suppose that G is an unbalanced signed graph of order n with e(G) edges. Let (G) be the spectral radius of G, and K4- be the set of the unbalanced K4. In this paper, we prove that if G is a K4--free unbalanced signed graph of order n, then e(G)≤slant n(n-1)2-(n-3) and (G)≤slant n-2. Moreover, the extremal graphs are completely characterized.

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…