Pages that link to "Item:Q2317661"
From MaRDI portal
The following pages link to On the \(k\)-independence number of graphs (Q2317661):
Displaying 23 items.
- Spectral bounds for the \(k\)-independence number of a graph (Q501229) (← links)
- New results on \(k\)-independence of graphs (Q528993) (← links)
- The \(k\)-independence number of direct products of graphs and Hedetniemi's conjecture (Q648993) (← links)
- On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs (Q1196745) (← links)
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers (Q2065879) (← links)
- The independence numbers of weighted graphs with forbidden cycles (Q2151383) (← links)
- Independence number of graphs and line graphs of trees by means of omega invariant (Q2174305) (← 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)
- The independence number of HH-homogeneous graphs and a classification of MB-homogeneous graphs (Q2297920) (← links)
- Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree (Q2657095) (← links)
- On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship (Q2700618) (← links)
- On \(k\)-independence critical graphs (Q2906868) (← links)
- (Q2936700) (← links)
- (Q3141602) (← links)
- k-Independence and thek-residue of a graph (Q4718734) (← links)
- (Q4885186) (← links)
- Spectral upper bound on the quantum k-independence number of a graph (Q5097504) (← links)
- On the number of independent sets in graphs with fixed independence number (Q5439048) (← links)
- Conjecture of TxGraffiti: Independence, domination, and matchings (Q5869457) (← 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)
