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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
