The spectral radius of H2k-free graphs

Qixuan Yuan, Ruifang Liu and Jinjiang Yuan

Applied Mathematics and Computation, 2024, vol. 469, issue C

Abstract: A fan, denoted by H2k, is the graph obtained by joining a vertex to a path with 2k vertices. A graph is H2k-free if it does not contain a subgraph H2k. Yuan (2021) [13] proved the Turán number and the extremal graphs of H2k-free graphs. In this paper, we characterize spectral extremal graphs of H2k-free graphs for sufficiently large n and k≥3.

Keywords: Spectral radius; H2k-free; Spectral extremal graphs (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324000328
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:469:y:2024:i:c:s0096300324000328

DOI: 10.1016/j.amc.2024.128560

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().