Pages that link to "Item:Q2657095"

The following pages link to Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree (Q2657095):

Displaying 20 items.

• Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
• On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence (Q394539) (← links)
• Spectral bounds for the \(k\)-independence number of a graph (Q501229) (← links)
• Highly connected subgraphs of graphs with given independence number (extended abstract) (Q510552) (← links)
• On local and global independence numbers of a graph (Q1414583) (← links)
• Bounds for the independence number in \(k\)-step Hamiltonian graphs (Q1650405) (← links)
• On the independence number in \(K_{1,r+1}\)-free graphs (Q1842181) (← links)
• New approach to the \(k\)-independence number of a graph (Q1953418) (← links)
• Optimization of eigenvalue bounds for the independence and chromatic number of graph powers (Q2065879) (← links)
• Toughness and normalized Laplacian eigenvalues of graphs (Q2139788) (← links)
• A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number (Q2197265) (← links)
• The \(k\)-independence number of \(t\)-connected graphs (Q2244182) (← links)
• On the \(k\)-independence number of graphs (Q2317661) (← links)
• On \(k\)-independence in graphs with emphasis on trees (Q2643314) (← links)
• On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship (Q2700618) (← links)
• Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes (Q2833255) (← links)
• A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ (Q5135732) (← links)
• The optimal bound on the 3-independence number obtainable from a polynomial-type method (Q6041879) (← links)
• On trees with given diameter and extremal number of distance-\(k\) independent sets (Q6644074) (← links)
• Independence number in graphs and its upper bounds (Q6669559) (← links)