Spectral Tur\'{a}n problem for $\mathcal{K}_5^{-}$-free signed graphs

Yongang Wang

Spectral Tur\'{a}n problem for $\mathcal{K}_5^{-}$-free signed graphs

Combinatorics 2023-09-28 v1

Authors: Yongang Wang

Abstract

The classical spectral Tur\'{a}n problem is to determine the maximum spectral radius of an $\mathcal{F}$ -free graph of order $n.$ Let $\mathcal{K}_{k}^{-}$ be the set of all unbalanced $K_k.$ In this paper, we focus on the spectral Tur\'{a}n problem of $\mathcal{K}_{k}^{-}$ -free unbalanced signed graph for $k\geq5$ . Moreover, we give an answer for $k=5$ and completely characterize the corresponding extremal signed graph.

Keywords

turán theory spectral graph theory

Cite

@article{arxiv.2309.15434,
  title  = {Spectral Tur\'{a}n problem for $\mathcal{K}_5^{-}$-free signed graphs},
  author = {Yongang Wang},
  journal= {arXiv preprint arXiv:2309.15434},
  year   = {2023}
}

Comments

arXiv admin note: substantial text overlap with arXiv:2309.04101

Related papers

View all related →