Pages that link to "Item:Q6041879"

The following pages link to The optimal bound on the 3-independence number obtainable from a polynomial-type method (Q6041879):

Displaying 7 items.

• Spectral bounds for the \(k\)-independence number of a graph (Q501229) (← links)
• Optimal graphs for independence and \(k\)-independence polynomials (Q1756111) (← links)
• Optimization of eigenvalue bounds for the independence and chromatic number of graph powers (Q2065879) (← links)
• A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number (Q2197265) (← links)
• On the \(k\)-independence number of graphs (Q2317661) (← links)
• On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship (Q2700618) (← links)
• The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds (Q6671386) (← links)