Spectral Turán problem for $t\mathcal{K}_{4}^{-}$-free unbalanced signed graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913026044592128 |
|---|---|
| author | Xie, Linfeng Liu, Xiaogang |
| author_facet | Xie, Linfeng Liu, Xiaogang |
| contents | Let $tK_4$ denote the family of all graphs consisting of $t$ copies of $K_4$ that are allowed to share vertices and $t\mathcal{K}_{4}^{-}$ be the set of all unbalanced signed graphs whose underlying graphs are elements of $tK_4$. In this paper, we characterize the extremal graphs that achieve the maximum index and spectral radius among all $t\mathcal{K}_{4}^{-}$-free unbalanced signed graphs with given order. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_11428 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Spectral Turán problem for $t\mathcal{K}_{4}^{-}$-free unbalanced signed graphs Xie, Linfeng Liu, Xiaogang Combinatorics Let $tK_4$ denote the family of all graphs consisting of $t$ copies of $K_4$ that are allowed to share vertices and $t\mathcal{K}_{4}^{-}$ be the set of all unbalanced signed graphs whose underlying graphs are elements of $tK_4$. In this paper, we characterize the extremal graphs that achieve the maximum index and spectral radius among all $t\mathcal{K}_{4}^{-}$-free unbalanced signed graphs with given order. |
| title | Spectral Turán problem for $t\mathcal{K}_{4}^{-}$-free unbalanced signed graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2604.11428 |