Sum of the k Largest Signless Laplacian Eigenvalues

Abstract

Abstract. Let G be a simple graph with n vertices, andIn this work, we present upper bounds for S + k (G) for K 2,s+1 -free graphs, for even cycle-free graphs and for odd cycle-free graphs.