Year: 2024
Type: preprint
Abstract: A graph is said to be $H$-free if it does not contain $H$ as a subgraph. Brualdi-Hoffman-Turá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á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].
Source: arXiv (Cornell University)
Authors: Chen, Fan, Yuan, Xiying
Institution: Shanghai University
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Awards: 超图谱理论中若干问题的研究, G9000176970
OpenAlex ID: W4403753454