Pages that link to "Item:Q2065879"

The following pages link to Optimization of eigenvalue bounds for the independence and chromatic number of graph powers (Q2065879):

Displaying 6 items.

• Characterizing and computing weight-equitable partitions of graphs (Q2132504) (← links)
• On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship (Q2700618) (← links)
• Spectral upper bound on the quantum k-independence number of a graph (Q5097504) (← links)
• The optimal bound on the 3-independence number obtainable from a polynomial-type method (Q6041879) (← links)
• A unified framework for the expander mixing lemma for irregular graphs and its applications (Q6618703) (← links)
• The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds (Q6671386) (← links)