Abstract
Let G be a graph of order n with m edges and clique number ω. Let μ1≥μ2≥…≥μn=0 be the Laplacian eigenvalues of G and let σ=σ(G)(1≤σ≤n) be the largest positive integer such that μσ≥2mn. In this paper we study the relation between σ and ω. In particular, we provide the answer to Problem 2.3 raised in Pirzada and Ganie (2015) [15]. Moreover, we characterize all connected threshold graphs with σ<ω−1, σ=ω−1 and σ>ω−1. We obtain Nordhaus–Gaddum-type results for σ. Some relations between σ with other graph invariants are obtained.
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.
