A Brualdi-Hoffman-Tur\'{a}n problem for friendship graph
| Autor: | Chen, Fan, Yuan, Xiying |
|---|---|
| Rok vydání: | 2024 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | A graph is said to be $H$-free if it does not contain $H$ as a subgraph. Brualdi-Hoffman-Tur\'{a}n type problem is to determine the maximum spectral radius of an $H$-free graph $G$ with give size $m$. The $F_k$ is the graph consisting of $k$ triangles that intersect in exactly one common vertex, which is known as the friendship graph. In this paper, we resolve a conjecture (the Brualdi-Hoffman-Tur\'{a}n-type problem for $F_k$) of Li, Lu and Peng [Discrete Math. 346 (2023) 113680] by using the $k$-core technique presented in Li, Zhai and Shu [European J. Combin, 120 (2024) 103966]. Comment: This article is a draft version and may have some clerical and grammatical errors |
| Databáze: | arXiv |
| Externí odkaz: |
|