Abstract
The classical spectral Turán problem is to determine the maximum spectral radius of an F-free graph of order n. Let Kk− be the set of all unbalanced Kk. Wang, Hou and Li [25] and Chen and Yuan [10] studied the existence of unbalanced K3 and K4, respectively. In this paper, we focus on the spectral Turán problem of Kk−-free signed graph for k≥5. By using a different method, we give an answer for k=5 and completely characterize the corresponding extremal signed graph.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
